diff -Nrcpad gcc-14-20250606/LAST_UPDATED gcc-14-20250613/LAST_UPDATED
*** gcc-14-20250606/LAST_UPDATED	Fri Jun  6 22:34:26 2025
--- gcc-14-20250613/LAST_UPDATED	Fri Jun 13 22:33:39 2025
***************
*** 1 ****
! Obtained from git: releases/gcc-14 revision cf7cb901d7ba3e5d7475d774c42dc5609f91b558
--- 1 ----
! Obtained from git: releases/gcc-14 revision ddf8b0e06f27667b689dbd970d6c4ab0f088d671
diff -Nrcpad gcc-14-20250606/MD5SUMS gcc-14-20250613/MD5SUMS
*** gcc-14-20250606/MD5SUMS	Fri Jun  6 22:34:30 2025
--- gcc-14-20250613/MD5SUMS	Fri Jun 13 22:33:44 2025
***************
*** 1,5 ****
  # This file contains the MD5 checksums of the files in the
! # gcc-14-20250606.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
--- 1,5 ----
  # This file contains the MD5 checksums of the files in the
! # gcc-14-20250613.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
*************** fc9280b02bc68e4fb1ef8d51ccc25061  Change
*** 23,29 ****
  fd4ecdf5d672efe2b0e409aca9cf9446  ChangeLog.jit
  09538b708302f1735f6fa05b622ecf5e  ChangeLog.tree-ssa
  24ab760126489e69436a43185dc3d202  INSTALL/README
! 7f8c1e0158fa6d44a5f53ee6e4e9d4c8  LAST_UPDATED
  1671040823f8eb8436a06fdd18065e02  MAINTAINERS
  304c3887135aefa27c21292ec585b0a3  Makefile.def
  8dd93fbf2e32bcbd2faba10e3b8ba2b0  Makefile.in
--- 23,29 ----
  fd4ecdf5d672efe2b0e409aca9cf9446  ChangeLog.jit
  09538b708302f1735f6fa05b622ecf5e  ChangeLog.tree-ssa
  24ab760126489e69436a43185dc3d202  INSTALL/README
! 37b2c58c57fa6d50ee6c910b9386aa86  LAST_UPDATED
  1671040823f8eb8436a06fdd18065e02  MAINTAINERS
  304c3887135aefa27c21292ec585b0a3  Makefile.def
  8dd93fbf2e32bcbd2faba10e3b8ba2b0  Makefile.in
*************** fb3fadb88e1d2b3b640cfaaa5ff11780  gcc/Ch
*** 541,547 ****
  3eb07e0b2e542409bf73d359f7f65609  gcc/ChangeLog.ptr
  e13638e26743ba41e6011b76cc00d9a9  gcc/ChangeLog.tree-ssa
  739ab47f6425bcea1d05e4fc0542de54  gcc/ChangeLog.tuples
! 8bb5eac2e9550e1095b356bd3a8f9838  gcc/DATESTAMP
  d41d8cd98f00b204e9800998ecf8427e  gcc/DEV-PHASE
  eb92e1ff5e982ca07e173e0eb286d243  gcc/FSFChangeLog
  30e1e33411566388b3164558482dc5e6  gcc/FSFChangeLog.10
--- 541,547 ----
  3eb07e0b2e542409bf73d359f7f65609  gcc/ChangeLog.ptr
  e13638e26743ba41e6011b76cc00d9a9  gcc/ChangeLog.tree-ssa
  739ab47f6425bcea1d05e4fc0542de54  gcc/ChangeLog.tuples
! 6629f7a02455d66b48faeb4a1d949fb0  gcc/DATESTAMP
  d41d8cd98f00b204e9800998ecf8427e  gcc/DEV-PHASE
  eb92e1ff5e982ca07e173e0eb286d243  gcc/FSFChangeLog
  30e1e33411566388b3164558482dc5e6  gcc/FSFChangeLog.10
*************** f90689370e66cea8434860b5a2b4ce6d  gcc/op
*** 7486,7492 ****
  45ddcc72ac7b1afaa7af97d8bc82c631  gcc/optabs-query.h
  2621e9c7af560a2b8e74cf60d4b9ad19  gcc/optabs-tree.cc
  13ecee26d0eed80122b7cdd5558365c0  gcc/optabs-tree.h
! 3c56647b5693fde7662ff144289710ca  gcc/optabs.cc
  1524c898bb70671cfa4ccd9cda136f8b  gcc/optabs.def
  043f510a745f66b5001f887999834c82  gcc/optabs.h
  460fed94230230ee1afb607142c60ed7  gcc/optc-gen.awk
--- 7486,7492 ----
  45ddcc72ac7b1afaa7af97d8bc82c631  gcc/optabs-query.h
  2621e9c7af560a2b8e74cf60d4b9ad19  gcc/optabs-tree.cc
  13ecee26d0eed80122b7cdd5558365c0  gcc/optabs-tree.h
! b7b7a3a69ee4aec8df4843eb6df44cf2  gcc/optabs.cc
  1524c898bb70671cfa4ccd9cda136f8b  gcc/optabs.def
  043f510a745f66b5001f887999834c82  gcc/optabs.h
  460fed94230230ee1afb607142c60ed7  gcc/optc-gen.awk
*************** d62f21136aedb5de39f00da2ce438022  gcc/re
*** 7573,7579 ****
  ab6d7ad46c79c6922e06b47e127ac0e3  gcc/read-rtl-function.cc
  05769e0c1dad9db0ecf442e1a710384e  gcc/read-rtl-function.h
  d0e0240ab5898db8d64694626b7a8a98  gcc/read-rtl.cc
! a7bef29c4a142f36a050b5f81b1263ed  gcc/real.cc
  9d2922bb55531074a578f60e3963a796  gcc/real.h
  411b413e1c87bce6c78f6243d9e662b9  gcc/realmpfr.cc
  2b4c19944566bf27cd500fc1e804e8c1  gcc/realmpfr.h
--- 7573,7579 ----
  ab6d7ad46c79c6922e06b47e127ac0e3  gcc/read-rtl-function.cc
  05769e0c1dad9db0ecf442e1a710384e  gcc/read-rtl-function.h
  d0e0240ab5898db8d64694626b7a8a98  gcc/read-rtl.cc
! aad316fa793c13d0740906af94c120a6  gcc/real.cc
  9d2922bb55531074a578f60e3963a796  gcc/real.h
  411b413e1c87bce6c78f6243d9e662b9  gcc/realmpfr.cc
  2b4c19944566bf27cd500fc1e804e8c1  gcc/realmpfr.h
*************** bb7d4e0bf6a65f0461a509285654b4ec  gcc/te
*** 41169,41174 ****
--- 41169,41175 ----
  be147aec3abbd5b08f579a216734b619  gcc/testsuite/gcc.dg/bitint-118.c
  c18469175af3ebdf263d34347ebe2d40  gcc/testsuite/gcc.dg/bitint-12.c
  d217543f954eb3f31e246355824f653a  gcc/testsuite/gcc.dg/bitint-120.c
+ 7d02ff9539e664bbbcfc85b464d916c1  gcc/testsuite/gcc.dg/bitint-123.c
  aa6e262f1d508ec048e76ac4af6675a4  gcc/testsuite/gcc.dg/bitint-13.c
  e6db29256563268a3c327706e78c79a4  gcc/testsuite/gcc.dg/bitint-14.c
  c748706240385773f27caba61cbbcbd8  gcc/testsuite/gcc.dg/bitint-15.c
*************** a3d075dd1b96232581aa40c9e02294e1  gcc/te
*** 46933,46938 ****
--- 46934,46940 ----
  5b4015cb994569a43c505c35b96cda44  gcc/testsuite/gcc.dg/pr119204.c
  212cef6b05e312dbd1f377cf4e35ab99  gcc/testsuite/gcc.dg/pr120048.c
  9444444b4f048eadd4b6a2d7592f5fca  gcc/testsuite/gcc.dg/pr120480.c
+ 4a9d9632d82cf6c4f4f4acbad8ab018d  gcc/testsuite/gcc.dg/pr120638.c
  bc5ddfbbc46f4e0cce1629d1b58d3090  gcc/testsuite/gcc.dg/pr12603.c
  72a2fca76cb69617ae36bab93c7ec0d7  gcc/testsuite/gcc.dg/pr12625-1.c
  6f0ef61e5a12db5f11da839b2988c5e1  gcc/testsuite/gcc.dg/pr13519-1.c
*************** eed87995921a41d6f215168315f20d67  gcc/te
*** 50449,50454 ****
--- 50451,50457 ----
  0f6fc6ed111e2e5782be3518bfe6e1eb  gcc/testsuite/gcc.dg/torture/pr117333.c
  6ae50575ec63bfcc997168ba66e3cd75  gcc/testsuite/gcc.dg/torture/pr117417.c
  211f874eb690213e110852d5efe7da32  gcc/testsuite/gcc.dg/torture/pr117574-1.c
+ fbc66d37323062d4dfeea9f5f179a29e  gcc/testsuite/gcc.dg/torture/pr117811.c
  66b62cd3c17e663e000967aafbe81bc7  gcc/testsuite/gcc.dg/torture/pr117979.c
  978db543837a14f17f7314fb0bc7ecad  gcc/testsuite/gcc.dg/torture/pr118184.c
  673535a31d0d70358a6475962b4d71c2  gcc/testsuite/gcc.dg/torture/pr118476-1.c
*************** bb2d0be00429a0759ac29d939a153bfd  gcc/tr
*** 110237,110243 ****
  4033e031a74b8591e4e99c6d0b936e95  gcc/tree-cfg.h
  d1d7e848234190caa5f2bf2e83aeb2d2  gcc/tree-cfgcleanup.cc
  33f85bca44e9b9e703bdf0cbdbaa732a  gcc/tree-cfgcleanup.h
! 17728251c02cecb3d9437862e6b9cef6  gcc/tree-chrec.cc
  56d59272a3fae6c32537f707febf66eb  gcc/tree-chrec.h
  628036cdbf2db5837b03e08a445438d9  gcc/tree-complex.cc
  ea5a0250e9186f164f0843e79aacedad  gcc/tree-core.h
--- 110240,110246 ----
  4033e031a74b8591e4e99c6d0b936e95  gcc/tree-cfg.h
  d1d7e848234190caa5f2bf2e83aeb2d2  gcc/tree-cfgcleanup.cc
  33f85bca44e9b9e703bdf0cbdbaa732a  gcc/tree-cfgcleanup.h
! 605fd454e8ce05f8f78d62001f72439b  gcc/tree-chrec.cc
  56d59272a3fae6c32537f707febf66eb  gcc/tree-chrec.h
  628036cdbf2db5837b03e08a445438d9  gcc/tree-complex.cc
  ea5a0250e9186f164f0843e79aacedad  gcc/tree-core.h
*************** acc4aff264e3f0e53b0b258a37163e6d  gcc/tr
*** 110321,110327 ****
  5b01b125f53e8b950350c0cd3cb6efd2  gcc/tree-ssa-loop-unswitch.cc
  55ae2e77440663854644a5c55e444332  gcc/tree-ssa-loop.cc
  ee1eafa40cd3c1d5777881a232cc123a  gcc/tree-ssa-loop.h
! 9d04d6f03a64fb639761342c8e4e7dce  gcc/tree-ssa-math-opts.cc
  a2aa940aaf235d855f0a29cd853cd161  gcc/tree-ssa-math-opts.h
  09cc12675477c15773525c18f05c8887  gcc/tree-ssa-operands.cc
  dec9c71d0caf6496e2b48ee295c14dd8  gcc/tree-ssa-operands.h
--- 110324,110330 ----
  5b01b125f53e8b950350c0cd3cb6efd2  gcc/tree-ssa-loop-unswitch.cc
  55ae2e77440663854644a5c55e444332  gcc/tree-ssa-loop.cc
  ee1eafa40cd3c1d5777881a232cc123a  gcc/tree-ssa-loop.h
! bc539e9ed912967e83cad1c6cc5d7cf2  gcc/tree-ssa-math-opts.cc
  a2aa940aaf235d855f0a29cd853cd161  gcc/tree-ssa-math-opts.h
  09cc12675477c15773525c18f05c8887  gcc/tree-ssa-operands.cc
  dec9c71d0caf6496e2b48ee295c14dd8  gcc/tree-ssa-operands.h
*************** d828e38384c506bf5e7d5a3c02725a37  libssp
*** 123616,123622 ****
  7bb3c32ba0a48d1cf785305e1b783eb6  libssp/strncpy-chk.c
  a19c79c1d86436e86b0fee41e6cf6b15  libssp/vsnprintf-chk.c
  145156e880b03115b393070d0ed37be3  libssp/vsprintf-chk.c
! 995d43d1f68dda2d8818c45a175536e8  libstdc++-v3/ChangeLog
  7aa6c40440a44fcf5ec94c066160c2f8  libstdc++-v3/ChangeLog-1998
  7aff86600b6a1ed3fa87305075a92db0  libstdc++-v3/ChangeLog-1999
  a6f28e8fc9bb07696a9e068b439a3a87  libstdc++-v3/ChangeLog-2000
--- 123619,123625 ----
  7bb3c32ba0a48d1cf785305e1b783eb6  libssp/strncpy-chk.c
  a19c79c1d86436e86b0fee41e6cf6b15  libssp/vsnprintf-chk.c
  145156e880b03115b393070d0ed37be3  libssp/vsprintf-chk.c
! 0a9f34f3c8cdbd5ce650436ed6b115e9  libstdc++-v3/ChangeLog
  7aa6c40440a44fcf5ec94c066160c2f8  libstdc++-v3/ChangeLog-1998
  7aff86600b6a1ed3fa87305075a92db0  libstdc++-v3/ChangeLog-1999
  a6f28e8fc9bb07696a9e068b439a3a87  libstdc++-v3/ChangeLog-2000
*************** d9b077b82911753368f65f3014d3311d  libstd
*** 123854,123860 ****
  c68ff21babfa14f20b98e36a2c808418  libstdc++-v3/doc/html/api.html
  08920438eea18325b4bfdf979379ff66  libstdc++-v3/doc/html/bk02.html
  47886ba7da131bf3cbf81a27cada5f6f  libstdc++-v3/doc/html/bk03.html
! 4ad77cb0a65c93dd0294a64b4bfb3230  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
--- 123857,123863 ----
  c68ff21babfa14f20b98e36a2c808418  libstdc++-v3/doc/html/api.html
  08920438eea18325b4bfdf979379ff66  libstdc++-v3/doc/html/bk02.html
  47886ba7da131bf3cbf81a27cada5f6f  libstdc++-v3/doc/html/bk03.html
! f8b26e04c810a70ae898ae5dc98c8b2e  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
*************** c60c6ae778d5dedae24ac21abf948bdb  libstd
*** 123953,123959 ****
  cc3700f2fde50987f186f23abf98a7b1  libstdc++-v3/doc/html/manual/concept_checking.html
  f3a54a6315d716742603d33f454f2c19  libstdc++-v3/doc/html/manual/concurrency.html
  e4aaeef0b98cb4c49ee46b83c543ca34  libstdc++-v3/doc/html/manual/configure.html
! af4e79b9e55fd023eeb0459df34a4a82  libstdc++-v3/doc/html/manual/containers.html
  c7e40c1085e414b3b4d5896db4013205  libstdc++-v3/doc/html/manual/containers_and_c.html
  1a937490b245964deeb0497dfdbfa840  libstdc++-v3/doc/html/manual/debug.html
  1bd34529d162b6f3a08d5f2ea4943c6a  libstdc++-v3/doc/html/manual/debug_mode.html
--- 123956,123962 ----
  cc3700f2fde50987f186f23abf98a7b1  libstdc++-v3/doc/html/manual/concept_checking.html
  f3a54a6315d716742603d33f454f2c19  libstdc++-v3/doc/html/manual/concurrency.html
  e4aaeef0b98cb4c49ee46b83c543ca34  libstdc++-v3/doc/html/manual/configure.html
! 5328918ec42768cddb06c3e97ef4530c  libstdc++-v3/doc/html/manual/containers.html
  c7e40c1085e414b3b4d5896db4013205  libstdc++-v3/doc/html/manual/containers_and_c.html
  1a937490b245964deeb0497dfdbfa840  libstdc++-v3/doc/html/manual/debug.html
  1bd34529d162b6f3a08d5f2ea4943c6a  libstdc++-v3/doc/html/manual/debug_mode.html
*************** afcc2751dae09e088abc1e3175cb94cc  libstd
*** 123973,123981 ****
  561a364254927bdc578ac31f1b66747f  libstdc++-v3/doc/html/manual/ext_demangling.html
  05003e71d54cfdfd4c8291489f8ffa07  libstdc++-v3/doc/html/manual/ext_io.html
  44f8ef8b093904d418755d0e32d700b7  libstdc++-v3/doc/html/manual/ext_iterators.html
! 8f3bd86e04d263ad87cc258c289aae6d  libstdc++-v3/doc/html/manual/ext_numerics.html
  6d380acac52eb8c888a54068e44b16ac  libstdc++-v3/doc/html/manual/ext_preface.html
! 5632eb8ef681cd35b41be7eb7a3d7a98  libstdc++-v3/doc/html/manual/ext_sgi.html
  9b34310c7cb7faa4373ee6683678c457  libstdc++-v3/doc/html/manual/ext_utilities.html
  9e255046a8ef2903114374ed06403045  libstdc++-v3/doc/html/manual/extensions.html
  76cac108e21e304b7607196fb5245e00  libstdc++-v3/doc/html/manual/facets.html
--- 123976,123984 ----
  561a364254927bdc578ac31f1b66747f  libstdc++-v3/doc/html/manual/ext_demangling.html
  05003e71d54cfdfd4c8291489f8ffa07  libstdc++-v3/doc/html/manual/ext_io.html
  44f8ef8b093904d418755d0e32d700b7  libstdc++-v3/doc/html/manual/ext_iterators.html
! ffd5e74a40bbf6623b8ccf687eb584d8  libstdc++-v3/doc/html/manual/ext_numerics.html
  6d380acac52eb8c888a54068e44b16ac  libstdc++-v3/doc/html/manual/ext_preface.html
! 6889f243ab6934ae5f80ea7fa9c69dbf  libstdc++-v3/doc/html/manual/ext_sgi.html
  9b34310c7cb7faa4373ee6683678c457  libstdc++-v3/doc/html/manual/ext_utilities.html
  9e255046a8ef2903114374ed06403045  libstdc++-v3/doc/html/manual/extensions.html
  76cac108e21e304b7607196fb5245e00  libstdc++-v3/doc/html/manual/facets.html
*************** fcdceeabf3a95117ea22e93a0354e564  libstd
*** 124031,124050 ****
  c39b927efcec5ac84139c1490c8ef320  libstdc++-v3/doc/html/manual/traits.html
  530b96535baacfe35df2e65f9dfe7efc  libstdc++-v3/doc/html/manual/unordered_associative.html
  ae44a39d1ac906098dd3e9fc8acd917e  libstdc++-v3/doc/html/manual/using.html
! ea78c1e7e98f6458923056e2b869969d  libstdc++-v3/doc/html/manual/using_concurrency.html
  f8898e59cc7155a01a17f15a3b853c30  libstdc++-v3/doc/html/manual/using_dual_abi.html
  a372b01a93ca1beeb843a1440bd25cdd  libstdc++-v3/doc/html/manual/using_dynamic_or_shared.html
  09eeb2fa79fb240e032461adcbe2cb4a  libstdc++-v3/doc/html/manual/using_exceptions.html
  6046d265a9d1a3d954dec8c82317fbff  libstdc++-v3/doc/html/manual/using_headers.html
  c8ee0e07a78cdcb3ed7cd3ed7ac16cc0  libstdc++-v3/doc/html/manual/using_macros.html
  ccc3b1a320ccc49a977c80546610195b  libstdc++-v3/doc/html/manual/using_namespaces.html
! d881fcffb799c09a28d8174ccb1326a2  libstdc++-v3/doc/html/manual/utilities.html
  ccbc0492a648982f2dc225595bdbc567  libstdc++-v3/doc/xml/api.xml
  8059eb81f5540dc3ae678ac09e1f3159  libstdc++-v3/doc/xml/authors.xml
  5906074c27c57c65b220c35bbcb2c5ec  libstdc++-v3/doc/xml/book.txml
  44d3a92b83abfb18efac80519c79b44c  libstdc++-v3/doc/xml/chapter.txml
  011b8e6a5442e4dc08f02e7295b644a3  libstdc++-v3/doc/xml/class.txml
! 2e681cceb238178e7b9da9cd744cdbdc  libstdc++-v3/doc/xml/faq.xml
  ea77580f7e81e2c49aea3f425c01ee2b  libstdc++-v3/doc/xml/gnu/fdl-1.3.xml
  56bb32e9ab9358834c5f8eca2cd0e969  libstdc++-v3/doc/xml/gnu/gpl-3.0.xml
  18a6390297702ec8fd75cbcc525d2005  libstdc++-v3/doc/xml/images/confdeps.dot
--- 124034,124053 ----
  c39b927efcec5ac84139c1490c8ef320  libstdc++-v3/doc/html/manual/traits.html
  530b96535baacfe35df2e65f9dfe7efc  libstdc++-v3/doc/html/manual/unordered_associative.html
  ae44a39d1ac906098dd3e9fc8acd917e  libstdc++-v3/doc/html/manual/using.html
! 08121b7fa3846487302afa82afc9d571  libstdc++-v3/doc/html/manual/using_concurrency.html
  f8898e59cc7155a01a17f15a3b853c30  libstdc++-v3/doc/html/manual/using_dual_abi.html
  a372b01a93ca1beeb843a1440bd25cdd  libstdc++-v3/doc/html/manual/using_dynamic_or_shared.html
  09eeb2fa79fb240e032461adcbe2cb4a  libstdc++-v3/doc/html/manual/using_exceptions.html
  6046d265a9d1a3d954dec8c82317fbff  libstdc++-v3/doc/html/manual/using_headers.html
  c8ee0e07a78cdcb3ed7cd3ed7ac16cc0  libstdc++-v3/doc/html/manual/using_macros.html
  ccc3b1a320ccc49a977c80546610195b  libstdc++-v3/doc/html/manual/using_namespaces.html
! 13c8dfb643338ee235bfc84a29e5d3f2  libstdc++-v3/doc/html/manual/utilities.html
  ccbc0492a648982f2dc225595bdbc567  libstdc++-v3/doc/xml/api.xml
  8059eb81f5540dc3ae678ac09e1f3159  libstdc++-v3/doc/xml/authors.xml
  5906074c27c57c65b220c35bbcb2c5ec  libstdc++-v3/doc/xml/book.txml
  44d3a92b83abfb18efac80519c79b44c  libstdc++-v3/doc/xml/chapter.txml
  011b8e6a5442e4dc08f02e7295b644a3  libstdc++-v3/doc/xml/class.txml
! ceb9ac8b1034d6c14b209dc0d11ef270  libstdc++-v3/doc/xml/faq.xml
  ea77580f7e81e2c49aea3f425c01ee2b  libstdc++-v3/doc/xml/gnu/fdl-1.3.xml
  56bb32e9ab9358834c5f8eca2cd0e969  libstdc++-v3/doc/xml/gnu/gpl-3.0.xml
  18a6390297702ec8fd75cbcc525d2005  libstdc++-v3/doc/xml/images/confdeps.dot
*************** b3f117e4c677e60cf6035cf76714b185  libstd
*** 124239,124252 ****
  af3361d0d0af961859ec0346c38ac8c8  libstdc++-v3/doc/xml/manual/concurrency.xml
  9da4610e32c81714e9188c6852c8dc93  libstdc++-v3/doc/xml/manual/concurrency_extensions.xml
  c814233bae2af79cc1273d72145d497c  libstdc++-v3/doc/xml/manual/configure.xml
! 0af07cc2460e288292186ea8149169ee  libstdc++-v3/doc/xml/manual/containers.xml
  d08c687d9520b2f9d8dd6d973cca9e6a  libstdc++-v3/doc/xml/manual/ctype.xml
  73da07ff0c1a31e349529a066ddefd62  libstdc++-v3/doc/xml/manual/debug.xml
  a972c915c47573572139ea9161dec244  libstdc++-v3/doc/xml/manual/debug_mode.xml
  f320f25003678cca910f09ba54c923fc  libstdc++-v3/doc/xml/manual/diagnostics.xml
  c7467f13981c47fc740c948b16a42a53  libstdc++-v3/doc/xml/manual/documentation_hacking.xml
  7913cf2fde8b99dad6a9926be9cae3d9  libstdc++-v3/doc/xml/manual/evolution.xml
! f9b28126e916ad19bb8350c6cb6bff95  libstdc++-v3/doc/xml/manual/extensions.xml
  7f1864c7f3c3b2bfde84b7086be97ca7  libstdc++-v3/doc/xml/manual/internals.xml
  51fce4cf657917cd7bc102d522b7c9ab  libstdc++-v3/doc/xml/manual/intro.xml
  93c3158fe28bdfbbf03dd039cc4e79a2  libstdc++-v3/doc/xml/manual/io.xml
--- 124242,124255 ----
  af3361d0d0af961859ec0346c38ac8c8  libstdc++-v3/doc/xml/manual/concurrency.xml
  9da4610e32c81714e9188c6852c8dc93  libstdc++-v3/doc/xml/manual/concurrency_extensions.xml
  c814233bae2af79cc1273d72145d497c  libstdc++-v3/doc/xml/manual/configure.xml
! d7100469dfefd97836f3007f2682087d  libstdc++-v3/doc/xml/manual/containers.xml
  d08c687d9520b2f9d8dd6d973cca9e6a  libstdc++-v3/doc/xml/manual/ctype.xml
  73da07ff0c1a31e349529a066ddefd62  libstdc++-v3/doc/xml/manual/debug.xml
  a972c915c47573572139ea9161dec244  libstdc++-v3/doc/xml/manual/debug_mode.xml
  f320f25003678cca910f09ba54c923fc  libstdc++-v3/doc/xml/manual/diagnostics.xml
  c7467f13981c47fc740c948b16a42a53  libstdc++-v3/doc/xml/manual/documentation_hacking.xml
  7913cf2fde8b99dad6a9926be9cae3d9  libstdc++-v3/doc/xml/manual/evolution.xml
! 250fbd9ce8e61158b22da9b231426c24  libstdc++-v3/doc/xml/manual/extensions.xml
  7f1864c7f3c3b2bfde84b7086be97ca7  libstdc++-v3/doc/xml/manual/internals.xml
  51fce4cf657917cd7bc102d522b7c9ab  libstdc++-v3/doc/xml/manual/intro.xml
  93c3158fe28bdfbbf03dd039cc4e79a2  libstdc++-v3/doc/xml/manual/io.xml
*************** e12241b98a6c1e835b7b1d1bb31761ca  libstd
*** 124275,124283 ****
  2b80feb1b53a8d0895a292620ec430b2  libstdc++-v3/doc/xml/manual/support.xml
  9b6e9edb319fa7d5d378de90a27f4f49  libstdc++-v3/doc/xml/manual/test.xml
  e2e099be3dd6a4b7a940a7232635ee2c  libstdc++-v3/doc/xml/manual/test_policy_data_structures.xml
! 663588c0324e0275daed903a7183244b  libstdc++-v3/doc/xml/manual/using.xml
  257e301935b13b4b045e571fa248a4d8  libstdc++-v3/doc/xml/manual/using_exceptions.xml
! 74a5acaa32b3d223bd413c1bb5b69ac6  libstdc++-v3/doc/xml/manual/utilities.xml
  e6f2e1ff035b9b144ac628a016da524a  libstdc++-v3/doc/xml/spine.xml
  bd966b4a0df6f2a84f9770525581d45c  libstdc++-v3/doc/xsl/customization.xsl.in
  42d14268f2b16c54a6bc2f71538a838c  libstdc++-v3/fragment.am
--- 124278,124286 ----
  2b80feb1b53a8d0895a292620ec430b2  libstdc++-v3/doc/xml/manual/support.xml
  9b6e9edb319fa7d5d378de90a27f4f49  libstdc++-v3/doc/xml/manual/test.xml
  e2e099be3dd6a4b7a940a7232635ee2c  libstdc++-v3/doc/xml/manual/test_policy_data_structures.xml
! 42f2dd529d430f80557927921d991fc8  libstdc++-v3/doc/xml/manual/using.xml
  257e301935b13b4b045e571fa248a4d8  libstdc++-v3/doc/xml/manual/using_exceptions.xml
! b820e3490221bb85cbf6bcdde0aa8150  libstdc++-v3/doc/xml/manual/utilities.xml
  e6f2e1ff035b9b144ac628a016da524a  libstdc++-v3/doc/xml/spine.xml
  bd966b4a0df6f2a84f9770525581d45c  libstdc++-v3/doc/xsl/customization.xsl.in
  42d14268f2b16c54a6bc2f71538a838c  libstdc++-v3/fragment.am
*************** c7a6720fba64940d0fa26db8b1690df2  libstd
*** 124309,124315 ****
  c72b1c964202f34f94adedd186dee7ec  libstdc++-v3/include/bits/c++config
  28aee543f6c9d197b0af864e888f0122  libstdc++-v3/include/bits/char_traits.h
  6859feb7dcc6695a2c6234641b888038  libstdc++-v3/include/bits/charconv.h
! b3ba0378f24b45c0114b4c8f4c94bcc6  libstdc++-v3/include/bits/chrono.h
  bb5e298ce560b9837ad2d0c798d3f51c  libstdc++-v3/include/bits/chrono_io.h
  88b76f5a51860ba832b9dc12ecb77d11  libstdc++-v3/include/bits/codecvt.h
  51b1ac432b9720acddaea7defbbb9885  libstdc++-v3/include/bits/concept_check.h
--- 124312,124318 ----
  c72b1c964202f34f94adedd186dee7ec  libstdc++-v3/include/bits/c++config
  28aee543f6c9d197b0af864e888f0122  libstdc++-v3/include/bits/char_traits.h
  6859feb7dcc6695a2c6234641b888038  libstdc++-v3/include/bits/charconv.h
! a2af06290cb60d50293e7486d3c7cd47  libstdc++-v3/include/bits/chrono.h
  bb5e298ce560b9837ad2d0c798d3f51c  libstdc++-v3/include/bits/chrono_io.h
  88b76f5a51860ba832b9dc12ecb77d11  libstdc++-v3/include/bits/codecvt.h
  51b1ac432b9720acddaea7defbbb9885  libstdc++-v3/include/bits/concept_check.h
*************** fda97f7d0f416dde1ab9178ea99e5455  libstd
*** 125007,125013 ****
  ae64ad244c17b2990bf7800baac14798  libstdc++-v3/include/std/execution
  9bfd85bc53277978862f2c4840fe93fa  libstdc++-v3/include/std/expected
  cff63c5eb4adb15a28919e1ffaaaa7be  libstdc++-v3/include/std/filesystem
! c2269b240ccc4b7a14638a3792b9cef3  libstdc++-v3/include/std/format
  e529270e2d060c63cc3ae4dd24c06e2a  libstdc++-v3/include/std/forward_list
  4183b8200ed6ff28ecd64696007af811  libstdc++-v3/include/std/fstream
  978a77434b110187a7e9c7b56843ce4b  libstdc++-v3/include/std/functional
--- 125010,125016 ----
  ae64ad244c17b2990bf7800baac14798  libstdc++-v3/include/std/execution
  9bfd85bc53277978862f2c4840fe93fa  libstdc++-v3/include/std/expected
  cff63c5eb4adb15a28919e1ffaaaa7be  libstdc++-v3/include/std/filesystem
! 8a3b79b607b896a3c97a91f3071e063c  libstdc++-v3/include/std/format
  e529270e2d060c63cc3ae4dd24c06e2a  libstdc++-v3/include/std/forward_list
  4183b8200ed6ff28ecd64696007af811  libstdc++-v3/include/std/fstream
  978a77434b110187a7e9c7b56843ce4b  libstdc++-v3/include/std/functional
*************** dc6c6bff46ec2e1289afb29019038359  libstd
*** 126918,126923 ****
--- 126921,126927 ----
  7ce526c9a6256391f9ec83573d350595  libstdc++-v3/testsuite/20_util/synchronized_pool_resource/release.cc
  6ff439348720463d3ddb23e39d28f26b  libstdc++-v3/testsuite/20_util/synchronized_pool_resource/release_single.cc
  35fae0105c98e525d2fe63303daabde9  libstdc++-v3/testsuite/20_util/system_clock/1.cc
+ 3df5d35bbcbd9760389b0f913b3844dc  libstdc++-v3/testsuite/20_util/system_clock/99832.cc
  a8b7dcc1b90032b42d3873d82d9de20e  libstdc++-v3/testsuite/20_util/system_clock/constexpr_data.cc
  b4f2bb383a977e0574c9225115c2e9d8  libstdc++-v3/testsuite/20_util/temporary_buffer.cc
  0026f2cc7274967cf0c76d743235a395  libstdc++-v3/testsuite/20_util/time_point/1.cc
*************** aff20c8c5cf69b2711343c5d3b008187  libstd
*** 134313,134319 ****
  742ac64fdc39fb1c49c3b80a89e939f1  libstdc++-v3/testsuite/std/format/formatter/requirements.cc
  a1d452e66d840a306985b18ad9ae0a8e  libstdc++-v3/testsuite/std/format/functions/107871.cc
  a7244ffd437f4addc853cfdd012c5cba  libstdc++-v3/testsuite/std/format/functions/114519.cc
! ff7c8c27163de662de00784af2661775  libstdc++-v3/testsuite/std/format/functions/format.cc
  8ee425f04d2e4782e67ab2eb62208b7f  libstdc++-v3/testsuite/std/format/functions/format_to.cc
  c5e2b63672ec2df6fdcba9b4e1ba3ba0  libstdc++-v3/testsuite/std/format/functions/format_to_n.cc
  f859e29ec6cd7017c9d0abc60ed4b8ce  libstdc++-v3/testsuite/std/format/functions/size.cc
--- 134317,134323 ----
  742ac64fdc39fb1c49c3b80a89e939f1  libstdc++-v3/testsuite/std/format/formatter/requirements.cc
  a1d452e66d840a306985b18ad9ae0a8e  libstdc++-v3/testsuite/std/format/functions/107871.cc
  a7244ffd437f4addc853cfdd012c5cba  libstdc++-v3/testsuite/std/format/functions/114519.cc
! e03d21d9a6a12566cd87cd0c1c22e55d  libstdc++-v3/testsuite/std/format/functions/format.cc
  8ee425f04d2e4782e67ab2eb62208b7f  libstdc++-v3/testsuite/std/format/functions/format_to.cc
  c5e2b63672ec2df6fdcba9b4e1ba3ba0  libstdc++-v3/testsuite/std/format/functions/format_to_n.cc
  f859e29ec6cd7017c9d0abc60ed4b8ce  libstdc++-v3/testsuite/std/format/functions/size.cc
diff -Nrcpad gcc-14-20250606/gcc/DATESTAMP gcc-14-20250613/gcc/DATESTAMP
*** gcc-14-20250606/gcc/DATESTAMP	Fri Jun  6 22:32:25 2025
--- gcc-14-20250613/gcc/DATESTAMP	Fri Jun 13 22:32:49 2025
***************
*** 1 ****
! 20250606
--- 1 ----
! 20250613
diff -Nrcpad gcc-14-20250606/gcc/optabs.cc gcc-14-20250613/gcc/optabs.cc
*** gcc-14-20250606/gcc/optabs.cc	Fri Jun  6 22:32:35 2025
--- gcc-14-20250613/gcc/optabs.cc	Fri Jun 13 22:32:52 2025
*************** avoid_expensive_constant (machine_mode m
*** 1368,1375 ****
  static rtx
  expand_binop_directly (enum insn_code icode, machine_mode mode, optab binoptab,
  		       rtx op0, rtx op1,
! 		       rtx target, int unsignedp, enum optab_methods methods,
! 		       rtx_insn *last)
  {
    machine_mode xmode0 = insn_data[(int) icode].operand[1].mode;
    machine_mode xmode1 = insn_data[(int) icode].operand[2].mode;
--- 1368,1374 ----
  static rtx
  expand_binop_directly (enum insn_code icode, machine_mode mode, optab binoptab,
  		       rtx op0, rtx op1,
! 		       rtx target, int unsignedp, enum optab_methods methods)
  {
    machine_mode xmode0 = insn_data[(int) icode].operand[1].mode;
    machine_mode xmode1 = insn_data[(int) icode].operand[2].mode;
*************** expand_binop_directly (enum insn_code ic
*** 1379,1384 ****
--- 1378,1384 ----
    rtx_insn *pat;
    rtx xop0 = op0, xop1 = op1;
    bool canonicalize_op1 = false;
+   rtx_insn *last = get_last_insn ();
  
    /* If it is a commutative operator and the modes would match
       if we would swap the operands, we can save the conversions.  */
*************** expand_binop_directly (enum insn_code ic
*** 1443,1452 ****
        tmp_mode = insn_data[(int) icode].operand[0].mode;
        if (VECTOR_MODE_P (mode)
  	  && maybe_ne (GET_MODE_NUNITS (tmp_mode), 2 * GET_MODE_NUNITS (mode)))
! 	{
! 	  delete_insns_since (last);
! 	  return NULL_RTX;
! 	}
      }
    else
      tmp_mode = mode;
--- 1443,1449 ----
        tmp_mode = insn_data[(int) icode].operand[0].mode;
        if (VECTOR_MODE_P (mode)
  	  && maybe_ne (GET_MODE_NUNITS (tmp_mode), 2 * GET_MODE_NUNITS (mode)))
! 	return NULL_RTX;
      }
    else
      tmp_mode = mode;
*************** expand_binop_directly (enum insn_code ic
*** 1466,1479 ****
  			       ops[1].value, ops[2].value, mode0))
  	{
  	  delete_insns_since (last);
! 	  return expand_binop (mode, binoptab, op0, op1, NULL_RTX,
! 			       unsignedp, methods);
  	}
  
        emit_insn (pat);
        return ops[0].value;
      }
!   delete_insns_since (last);
    return NULL_RTX;
  }
  
--- 1463,1476 ----
  			       ops[1].value, ops[2].value, mode0))
  	{
  	  delete_insns_since (last);
! 	  return expand_binop_directly (icode, mode, binoptab, op0, op1,
! 					NULL_RTX, unsignedp, methods);
  	}
  
        emit_insn (pat);
        return ops[0].value;
      }
! 
    return NULL_RTX;
  }
  
*************** expand_binop (machine_mode mode, optab b
*** 1542,1550 ****
        if (icode != CODE_FOR_nothing)
  	{
  	  temp = expand_binop_directly (icode, mode, binoptab, op0, op1,
! 					target, unsignedp, methods, last);
  	  if (temp)
  	    return temp;
  	}
      }
  
--- 1539,1548 ----
        if (icode != CODE_FOR_nothing)
  	{
  	  temp = expand_binop_directly (icode, mode, binoptab, op0, op1,
! 					target, unsignedp, methods);
  	  if (temp)
  	    return temp;
+ 	  delete_insns_since (last);
  	}
      }
  
*************** expand_binop (machine_mode mode, optab b
*** 1570,1578 ****
  			       NULL_RTX, unsignedp, OPTAB_DIRECT);
  
        temp = expand_binop_directly (icode, int_mode, otheroptab, op0, newop1,
! 				    target, unsignedp, methods, last);
        if (temp)
  	return temp;
      }
  
    /* If this is a multiply, see if we can do a widening operation that
--- 1568,1577 ----
  			       NULL_RTX, unsignedp, OPTAB_DIRECT);
  
        temp = expand_binop_directly (icode, int_mode, otheroptab, op0, newop1,
! 				    target, unsignedp, methods);
        if (temp)
  	return temp;
+       delete_insns_since (last);
      }
  
    /* If this is a multiply, see if we can do a widening operation that
*************** expand_binop (machine_mode mode, optab b
*** 1636,1644 ****
  	  if (vop1)
  	    {
  	      temp = expand_binop_directly (icode, mode, otheroptab, op0, vop1,
! 					    target, unsignedp, methods, last);
  	      if (temp)
  		return temp;
  	    }
  	}
      }
--- 1635,1644 ----
  	  if (vop1)
  	    {
  	      temp = expand_binop_directly (icode, mode, otheroptab, op0, vop1,
! 					    target, unsignedp, methods);
  	      if (temp)
  		return temp;
+ 	      delete_insns_since (last);
  	    }
  	}
      }
diff -Nrcpad gcc-14-20250606/gcc/real.cc gcc-14-20250613/gcc/real.cc
*** gcc-14-20250606/gcc/real.cc	Fri Jun  6 22:32:35 2025
--- gcc-14-20250613/gcc/real.cc	Fri Jun 13 22:32:52 2025
*************** real_from_integer (REAL_VALUE_TYPE *r, f
*** 2230,2236 ****
      {
        unsigned int len = val_in.get_precision ();
        int i, j, e = 0;
-       int maxbitlen = MAX_BITSIZE_MODE_ANY_INT + HOST_BITS_PER_WIDE_INT;
        const unsigned int realmax = (SIGNIFICAND_BITS / HOST_BITS_PER_WIDE_INT
  				    * HOST_BITS_PER_WIDE_INT);
  
--- 2230,2235 ----
*************** real_from_integer (REAL_VALUE_TYPE *r, f
*** 2238,2249 ****
        r->cl = rvc_normal;
        r->sign = wi::neg_p (val_in, sgn);
  
-       /* We have to ensure we can negate the largest negative number.  */
-       wide_int val = wide_int::from (val_in, maxbitlen, sgn);
- 
-       if (r->sign)
- 	val = -val;
- 
        /* Ensure a multiple of HOST_BITS_PER_WIDE_INT, ceiling, as elt
  	 won't work with precisions that are not a multiple of
  	 HOST_BITS_PER_WIDE_INT.  */
--- 2237,2242 ----
*************** real_from_integer (REAL_VALUE_TYPE *r, f
*** 2252,2258 ****
        /* Ensure we can represent the largest negative number.  */
        len += 1;
  
!       len = len/HOST_BITS_PER_WIDE_INT * HOST_BITS_PER_WIDE_INT;
  
        /* Cap the size to the size allowed by real.h.  */
        if (len > realmax)
--- 2245,2257 ----
        /* Ensure we can represent the largest negative number.  */
        len += 1;
  
!       len = len / HOST_BITS_PER_WIDE_INT * HOST_BITS_PER_WIDE_INT;
! 
!       /* We have to ensure we can negate the largest negative number.  */
!       wide_int val = wide_int::from (val_in, len, sgn);
! 
!       if (r->sign)
! 	val = -val;
  
        /* Cap the size to the size allowed by real.h.  */
        if (len > realmax)
*************** real_from_integer (REAL_VALUE_TYPE *r, f
*** 2260,2273 ****
  	  HOST_WIDE_INT cnt_l_z;
  	  cnt_l_z = wi::clz (val);
  
! 	  if (maxbitlen - cnt_l_z > realmax)
  	    {
! 	      e = maxbitlen - cnt_l_z - realmax;
  
  	      /* This value is too large, we must shift it right to
  		 preserve all the bits we can, and then bump the
! 		 exponent up by that amount.  */
! 	      val = wi::lrshift (val, e);
  	    }
  	  len = realmax;
  	}
--- 2259,2276 ----
  	  HOST_WIDE_INT cnt_l_z;
  	  cnt_l_z = wi::clz (val);
  
! 	  if (len - cnt_l_z > realmax)
  	    {
! 	      e = len - cnt_l_z - realmax;
  
  	      /* This value is too large, we must shift it right to
  		 preserve all the bits we can, and then bump the
! 		 exponent up by that amount, but or in 1 if any of
! 		 the shifted out bits are non-zero.  */
! 	      if (wide_int::from (val, e, UNSIGNED) != 0)
! 		val = wi::set_bit (wi::lrshift (val, e), 0);
! 	      else
! 		val = wi::lrshift (val, e);
  	    }
  	  len = realmax;
  	}
diff -Nrcpad gcc-14-20250606/gcc/testsuite/gcc.dg/bitint-123.c gcc-14-20250613/gcc/testsuite/gcc.dg/bitint-123.c
*** gcc-14-20250606/gcc/testsuite/gcc.dg/bitint-123.c	Thu Jan  1 00:00:00 1970
--- gcc-14-20250613/gcc/testsuite/gcc.dg/bitint-123.c	Fri Jun 13 22:33:01 2025
***************
*** 0 ****
--- 1,26 ----
+ /* PR middle-end/120547 */
+ /* { dg-do run { target bitint } } */
+ /* { dg-options "-O2" } */
+ /* { dg-add-options float64 } */
+ /* { dg-require-effective-target float64 } */
+ 
+ #define CHECK(x, y) \
+   if ((_Float64) x != (_Float64) y				\
+       || (_Float64) (x + 1) != (_Float64) (y + 1))		\
+     __builtin_abort ()
+ 
+ int
+ main ()
+ {
+   unsigned long long a = 0x20000000000001ULL << 7;
+   volatile unsigned long long b = a;
+   CHECK (a, b);
+ #if __BITINT_MAXWIDTH__ >= 4096
+   unsigned _BitInt(4096) c = ((unsigned _BitInt(4096)) 0x20000000000001ULL) << 253;
+   volatile unsigned _BitInt(4096) d = c;
+   CHECK (c, d);
+   unsigned _BitInt(4096) e = ((unsigned _BitInt(4096)) 0x20000000000001ULL) << 931;
+   volatile unsigned _BitInt(4096) f = e;
+   CHECK (e, f);
+ #endif
+ }
diff -Nrcpad gcc-14-20250606/gcc/testsuite/gcc.dg/pr120638.c gcc-14-20250613/gcc/testsuite/gcc.dg/pr120638.c
*** gcc-14-20250606/gcc/testsuite/gcc.dg/pr120638.c	Thu Jan  1 00:00:00 1970
--- gcc-14-20250613/gcc/testsuite/gcc.dg/pr120638.c	Fri Jun 13 22:33:03 2025
***************
*** 0 ****
--- 1,31 ----
+ /* PR tree-optimization/120638 */
+ /* { dg-do run } */
+ /* { dg-options "-O2 -ffast-math" } */
+ 
+ extern float sqrtf (float x);
+ 
+ __attribute__((noipa)) float
+ foo (unsigned int s)
+ {
+   return 0.5f / sqrtf (1.f + s);
+ }
+ 
+ __attribute__((noipa)) float
+ bar (float s)
+ {
+   if (s < 0.0 || s > 65535.0f)
+     __builtin_unreachable ();
+   return 0.5f / sqrtf (1.f + s);
+ }
+ 
+ int
+ main ()
+ {
+   if (__builtin_fabsf (foo (3) - 0.25f) > 0.00390625f
+       || __builtin_fabsf (foo (15) - 0.125f) > 0.00390625f
+       || __builtin_fabsf (foo (63) - 0.0625f) > 0.00390625f
+       || __builtin_fabsf (bar (3.0f) - 0.25f) > 0.00390625f
+       || __builtin_fabsf (bar (15.0f) - 0.125f) > 0.00390625f
+       || __builtin_fabsf (bar (63.0f) - 0.0625f) > 0.00390625f)
+     __builtin_abort ();
+ }
diff -Nrcpad gcc-14-20250606/gcc/testsuite/gcc.dg/torture/pr117811.c gcc-14-20250613/gcc/testsuite/gcc.dg/torture/pr117811.c
*** gcc-14-20250606/gcc/testsuite/gcc.dg/torture/pr117811.c	Thu Jan  1 00:00:00 1970
--- gcc-14-20250613/gcc/testsuite/gcc.dg/torture/pr117811.c	Fri Jun 13 22:33:03 2025
***************
*** 0 ****
--- 1,32 ----
+ /* { dg-do run } */
+ 
+ #include <string.h>
+ 
+ typedef int v4 __attribute__((vector_size (4 * sizeof (int))));
+ 
+ void __attribute__((noclone,noinline)) do_shift (v4 *vec, int shift)
+ {
+   v4 t = *vec;
+ 
+   if (shift > 0)
+   {
+     t = t >> shift;
+   }
+ 
+   *vec = t;
+ }
+ 
+ int main ()
+ {
+ #if __SIZEOF_INT__ >= 4
+   v4 vec =  {0x1000000, 0x2000, 0x300, 0x40};
+   v4 vec2 = {0x100000,  0x200,  0x30,  0x4};
+ #else
+   v4 vec =  {0x4000, 0x2000, 0x300, 0x40};
+   v4 vec2 = {0x400,  0x200,  0x30,  0x4};
+ #endif
+   do_shift (&vec, 4);
+   if (memcmp (&vec, &vec2, sizeof (v4)) != 0)
+     __builtin_abort ();
+   return 0;
+ }
diff -Nrcpad gcc-14-20250606/gcc/tree-chrec.cc gcc-14-20250613/gcc/tree-chrec.cc
*** gcc-14-20250606/gcc/tree-chrec.cc	Fri Jun  6 22:33:33 2025
--- gcc-14-20250613/gcc/tree-chrec.cc	Fri Jun 13 22:33:20 2025
*************** convert_affine_scev (class loop *loop, t
*** 1490,1496 ****
    new_step = *step;
    if (TYPE_PRECISION (step_type) > TYPE_PRECISION (ct) && TYPE_UNSIGNED (ct))
      {
!       tree signed_ct = build_nonstandard_integer_type (TYPE_PRECISION (ct), 0);
        new_step = chrec_convert (signed_ct, new_step, at_stmt,
                                  use_overflow_semantics);
      }
--- 1490,1496 ----
    new_step = *step;
    if (TYPE_PRECISION (step_type) > TYPE_PRECISION (ct) && TYPE_UNSIGNED (ct))
      {
!       tree signed_ct = signed_type_for (ct);
        new_step = chrec_convert (signed_ct, new_step, at_stmt,
                                  use_overflow_semantics);
      }
diff -Nrcpad gcc-14-20250606/gcc/tree-ssa-math-opts.cc gcc-14-20250613/gcc/tree-ssa-math-opts.cc
*** gcc-14-20250606/gcc/tree-ssa-math-opts.cc	Fri Jun  6 22:33:33 2025
--- gcc-14-20250613/gcc/tree-ssa-math-opts.cc	Fri Jun 13 22:33:20 2025
*************** pass_cse_reciprocals::execute (function
*** 1052,1057 ****
--- 1052,1058 ----
  		    continue;
  
  		  gimple_replace_ssa_lhs (call, arg1);
+ 		  reset_flow_sensitive_info (arg1);
  		  if (gimple_call_internal_p (call) != (ifn != IFN_LAST))
  		    {
  		      auto_vec<tree, 4> args;
diff -Nrcpad gcc-14-20250606/libstdc++-v3/ChangeLog gcc-14-20250613/libstdc++-v3/ChangeLog
*** gcc-14-20250606/libstdc++-v3/ChangeLog	Fri Jun  6 22:34:01 2025
--- gcc-14-20250613/libstdc++-v3/ChangeLog	Fri Jun 13 22:33:26 2025
***************
*** 1,3 ****
--- 1,47 ----
+ 2025-06-11  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	Backported from master:
+ 	2025-06-05  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	PR libstdc++/120548
+ 	* include/std/format (__formatter_fp::_M_localize): Do not
+ 	include a leading sign character in the string to be grouped.
+ 	* testsuite/std/format/functions/format.cc: Check grouping when
+ 	sign is present in the output.
+ 
+ 2025-06-11  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	Backported from master:
+ 	2024-09-14  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	* include/std/format (__formatter_fp::_M_localize): Add comments
+ 	and micro-optimize string copy.
+ 
+ 2025-06-11  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	Backported from master:
+ 	2025-06-04  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	PR libstdc++/99832
+ 	* include/bits/chrono.h (system_clock::to_time_t): Add
+ 	always_inline attribute to be agnostic to the underlying type of
+ 	time_t.
+ 	(system_clock::from_time_t): Add always_inline for consistency
+ 	with to_time_t.
+ 	* testsuite/20_util/system_clock/99832.cc: New test.
+ 
+ 2025-06-10  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	Backported from master:
+ 	2025-05-20  Jonathan Wakely  <jwakely@redhat.com>
+ 
+ 	* doc/xml/faq.xml: Update URL for archived SGI STL docs.
+ 	* doc/xml/manual/containers.xml: Likewise.
+ 	* doc/xml/manual/extensions.xml: Likewise.
+ 	* doc/xml/manual/using.xml: Likewise.
+ 	* doc/xml/manual/utilities.xml: Likewise.
+ 	* doc/html/*: Regenerate.
+ 
  2025-06-05  Giuseppe D'Angelo  <giuseppe.dangelo@kdab.com>
  
  	Backported from master:
diff -Nrcpad gcc-14-20250606/libstdc++-v3/doc/html/faq.html gcc-14-20250613/libstdc++-v3/doc/html/faq.html
*** gcc-14-20250606/libstdc++-v3/doc/html/faq.html	Fri Jun  6 22:34:02 2025
--- gcc-14-20250613/libstdc++-v3/doc/html/faq.html	Fri Jun 13 22:33:26 2025
***************
*** 796,802 ****
      Libstdc++-v3 incorporates a lot of code from
      <a class="link" href="https://web.archive.org/web/20171225062613/http://www.sgi.com/tech/stl/" target="_top">the SGI STL</a>
      (the final merge was from
!     <a class="link" href="https://web.archive.org/web/20171225062613/http://www.sgi.com/tech/stl/whats_new.html" target="_top">release 3.3</a>).
      The code in libstdc++ contains many fixes and changes compared to the
      original SGI code.
      </p><p>
--- 796,802 ----
      Libstdc++-v3 incorporates a lot of code from
      <a class="link" href="https://web.archive.org/web/20171225062613/http://www.sgi.com/tech/stl/" target="_top">the SGI STL</a>
      (the final merge was from
!     <a class="link" href="https://web.archive.org/web/20171206110416/http://www.sgi.com/tech/stl/whats_new.html" target="_top">release 3.3</a>).
      The code in libstdc++ contains many fixes and changes compared to the
      original SGI code.
      </p><p>
diff -Nrcpad gcc-14-20250606/libstdc++-v3/doc/html/manual/containers.html gcc-14-20250613/libstdc++-v3/doc/html/manual/containers.html
*** gcc-14-20250606/libstdc++-v3/doc/html/manual/containers.html	Fri Jun  6 22:34:02 2025
--- gcc-14-20250613/libstdc++-v3/doc/html/manual/containers.html	Fri Jun 13 22:33:26 2025
***************
*** 11,17 ****
       Yes it is, at least using the <a class="link" href="using_dual_abi.html" title="Dual ABI">old
       ABI</a>, and that's okay.  This is a decision that we preserved
       when we imported SGI's STL implementation.  The following is
!      quoted from <a class="link" href="https://web.archive.org/web/20171225062613/http://www.sgi.com/tech/stl/FAQ.html" target="_top">their FAQ</a>:
     </p><div class="blockquote"><blockquote class="blockquote"><p>
         The size() member function, for list and slist, takes time
         proportional to the number of elements in the list.  This was a
--- 11,17 ----
       Yes it is, at least using the <a class="link" href="using_dual_abi.html" title="Dual ABI">old
       ABI</a>, and that's okay.  This is a decision that we preserved
       when we imported SGI's STL implementation.  The following is
!      quoted from <a class="link" href="https://web.archive.org/web/20161222192301/http://www.sgi.com/tech/stl/FAQ.html" target="_top">their FAQ</a>:
     </p><div class="blockquote"><blockquote class="blockquote"><p>
         The size() member function, for list and slist, takes time
         proportional to the number of elements in the list.  This was a
diff -Nrcpad gcc-14-20250606/libstdc++-v3/doc/html/manual/ext_numerics.html gcc-14-20250613/libstdc++-v3/doc/html/manual/ext_numerics.html
*** gcc-14-20250606/libstdc++-v3/doc/html/manual/ext_numerics.html	Fri Jun  6 22:34:02 2025
--- gcc-14-20250613/libstdc++-v3/doc/html/manual/ext_numerics.html	Fri Jun 13 22:33:26 2025
***************
*** 14,20 ****
     The operation functor must be associative.
  </p><p>The <code class="code">iota</code> function wins the award for Extension With the
     Coolest Name (the name comes from Ken Iverson's APL language.)  As
!    described in the <a class="link" href="https://web.archive.org/web/20171225062613/http://www.sgi.com/tech/stl/iota.html" target="_top">SGI
     documentation</a>, it "assigns sequentially increasing values to a range.
     That is, it assigns <code class="code">value</code> to <code class="code">*first</code>,
     <code class="code">value + 1</code> to<code class="code"> *(first + 1)</code> and so on."
--- 14,20 ----
     The operation functor must be associative.
  </p><p>The <code class="code">iota</code> function wins the award for Extension With the
     Coolest Name (the name comes from Ken Iverson's APL language.)  As
!    described in the <a class="link" href="https://web.archive.org/web/20170201044840/http://www.sgi.com/tech/stl/iota.html" target="_top">SGI
     documentation</a>, it "assigns sequentially increasing values to a range.
     That is, it assigns <code class="code">value</code> to <code class="code">*first</code>,
     <code class="code">value + 1</code> to<code class="code"> *(first + 1)</code> and so on."
diff -Nrcpad gcc-14-20250606/libstdc++-v3/doc/html/manual/ext_sgi.html gcc-14-20250613/libstdc++-v3/doc/html/manual/ext_sgi.html
*** gcc-14-20250606/libstdc++-v3/doc/html/manual/ext_sgi.html	Fri Jun  6 22:34:02 2025
--- gcc-14-20250613/libstdc++-v3/doc/html/manual/ext_sgi.html	Fri Jun 13 22:33:26 2025
***************
*** 28,39 ****
        and sets.
     </p><p>Each of the associative containers map, multimap, set, and multiset
        have a counterpart which uses a
!       <a class="link" href="https://web.archive.org/web/20171225062613/http://www.sgi.com/tech/stl/HashFunction.html" target="_top">hashing
        function</a> to do the arranging, instead of a strict weak ordering
        function.  The classes take as one of their template parameters a
        function object that will return the hash value; by default, an
        instantiation of
!       <a class="link" href="https://web.archive.org/web/20171225062613/http://www.sgi.com/tech/stl/hash.html" target="_top">hash</a>.
        You should specialize this functor for your class, or define your own,
        before trying to use one of the hashing classes.
     </p><p>The hashing classes support all the usual associative container
--- 28,39 ----
        and sets.
     </p><p>Each of the associative containers map, multimap, set, and multiset
        have a counterpart which uses a
!       <a class="link" href="https://web.archive.org/web/20171230172024/http://www.sgi.com/tech/stl/HashFunction.html" target="_top">hashing
        function</a> to do the arranging, instead of a strict weak ordering
        function.  The classes take as one of their template parameters a
        function object that will return the hash value; by default, an
        instantiation of
!       <a class="link" href="https://web.archive.org/web/20171230172200/http://www.sgi.com/tech/stl/hash.html" target="_top">hash</a>.
        You should specialize this functor for your class, or define your own,
        before trying to use one of the hashing classes.
     </p><p>The hashing classes support all the usual associative container
diff -Nrcpad gcc-14-20250606/libstdc++-v3/doc/html/manual/using_concurrency.html gcc-14-20250613/libstdc++-v3/doc/html/manual/using_concurrency.html
*** gcc-14-20250606/libstdc++-v3/doc/html/manual/using_concurrency.html	Fri Jun  6 22:34:02 2025
--- gcc-14-20250613/libstdc++-v3/doc/html/manual/using_concurrency.html	Fri Jun 13 22:33:27 2025
*************** The standard places requirements on the
*** 40,46 ****
  races are caused by the library itself or by programs which use the
  library correctly (as described below).
  The C++11 memory model and library requirements are a more formal version
! of the <a class="link" href="https://web.archive.org/web/20171225062613/http://www.sgi.com/tech/stl/thread_safety.html" target="_top">SGI STL</a> definition of thread safety, which the library used
  prior to the 2011 standard.
  </p><p>The library strives to be thread-safe when all of the following
  	 conditions are met:
--- 40,46 ----
  races are caused by the library itself or by programs which use the
  library correctly (as described below).
  The C++11 memory model and library requirements are a more formal version
! of the <a class="link" href="https://web.archive.org/web/20171221154911/http://www.sgi.com/tech/stl/thread_safety.html" target="_top">SGI STL</a> definition of thread safety, which the library used
  prior to the 2011 standard.
  </p><p>The library strives to be thread-safe when all of the following
  	 conditions are met:
*************** gcc version 4.1.2 20070925 (Red Hat 4.1.
*** 243,252 ****
        threaded and non-threaded code), see Chapter 17.
     </p><p>Two excellent pages to read when working with the Standard C++
        containers and threads are
!       <a class="link" href="https://web.archive.org/web/20171225062613/http://www.sgi.com/tech/stl/thread_safety.html" target="_top">SGI's
!       https://web.archive.org/web/20171225062613/http://www.sgi.com/tech/stl/thread_safety.html</a> and
!       <a class="link" href="https://web.archive.org/web/20171225062613/http://www.sgi.com/tech/stl/Allocators.html" target="_top">SGI's
!       https://web.archive.org/web/20171225062613/http://www.sgi.com/tech/stl/Allocators.html</a>.
     </p><p><span class="emphasis"><em>However, please ignore all discussions about the user-level
        configuration of the lock implementation inside the STL
        container-memory allocator on those pages.  For the sake of this
--- 243,252 ----
        threaded and non-threaded code), see Chapter 17.
     </p><p>Two excellent pages to read when working with the Standard C++
        containers and threads are
!       <a class="link" href="https://web.archive.org/web/20171221154911/http://www.sgi.com/tech/stl/thread_safety.html" target="_top">SGI's
!       https://web.archive.org/web/20171221154911/http://www.sgi.com/tech/stl/thread_safety.html</a> and
!       <a class="link" href="https://web.archive.org/web/20171108142526/http://www.sgi.com/tech/stl/Allocators.html" target="_top">SGI's
!       https://web.archive.org/web/20171108142526/http://www.sgi.com/tech/stl/Allocators.html</a>.
     </p><p><span class="emphasis"><em>However, please ignore all discussions about the user-level
        configuration of the lock implementation inside the STL
        container-memory allocator on those pages.  For the sake of this
diff -Nrcpad gcc-14-20250606/libstdc++-v3/doc/html/manual/utilities.html gcc-14-20250613/libstdc++-v3/doc/html/manual/utilities.html
*** gcc-14-20250606/libstdc++-v3/doc/html/manual/utilities.html	Fri Jun  6 22:34:02 2025
--- gcc-14-20250613/libstdc++-v3/doc/html/manual/utilities.html	Fri Jun 13 22:33:27 2025
***************
*** 11,16 ****
        get slightly the wrong idea.  In the interest of not reinventing
        the wheel, we will refer you to the introduction to the functor
        concept written by SGI as part of their STL, in
!       <a class="link" href="https://web.archive.org/web/20171225062613/http://www.sgi.com/tech/stl/functors.html" target="_top">their
!       https://web.archive.org/web/20171225062613/http://www.sgi.com/tech/stl/functors.html</a>.
     </p></div></div><div class="navfooter"><hr /><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"><a accesskey="p" href="concept_checking.html">Prev</a> </td><td width="20%" align="center"><a accesskey="u" href="std_contents.html">Up</a></td><td width="40%" align="right"> <a accesskey="n" href="pairs.html">Next</a></td></tr><tr><td width="40%" align="left" valign="top">Concept Checking </td><td width="20%" align="center"><a accesskey="h" href="../index.html">Home</a></td><td width="40%" align="right" valign="top"> Pairs</td></tr></table></div></body></html>
\ No newline at end of file
--- 11,16 ----
        get slightly the wrong idea.  In the interest of not reinventing
        the wheel, we will refer you to the introduction to the functor
        concept written by SGI as part of their STL, in
!       <a class="link" href="https://web.archive.org/web/20171209002754/http://www.sgi.com/tech/stl/functors.html" target="_top">their
!       https://web.archive.org/web/20171209002754/http://www.sgi.com/tech/stl/functors.html</a>.
     </p></div></div><div class="navfooter"><hr /><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"><a accesskey="p" href="concept_checking.html">Prev</a> </td><td width="20%" align="center"><a accesskey="u" href="std_contents.html">Up</a></td><td width="40%" align="right"> <a accesskey="n" href="pairs.html">Next</a></td></tr><tr><td width="40%" align="left" valign="top">Concept Checking </td><td width="20%" align="center"><a accesskey="h" href="../index.html">Home</a></td><td width="40%" align="right" valign="top"> Pairs</td></tr></table></div></body></html>
\ No newline at end of file
diff -Nrcpad gcc-14-20250606/libstdc++-v3/doc/xml/faq.xml gcc-14-20250613/libstdc++-v3/doc/xml/faq.xml
*** gcc-14-20250606/libstdc++-v3/doc/xml/faq.xml	Fri Jun  6 22:34:02 2025
--- gcc-14-20250613/libstdc++-v3/doc/xml/faq.xml	Fri Jun 13 22:33:27 2025
***************
*** 1130,1136 ****
      Libstdc++-v3 incorporates a lot of code from
      <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="https://web.archive.org/web/20171225062613/http://www.sgi.com/tech/stl/">the SGI STL</link>
      (the final merge was from
!     <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="https://web.archive.org/web/20171225062613/http://www.sgi.com/tech/stl/whats_new.html">release 3.3</link>).
      The code in libstdc++ contains many fixes and changes compared to the
      original SGI code.
      </para>
--- 1130,1136 ----
      Libstdc++-v3 incorporates a lot of code from
      <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="https://web.archive.org/web/20171225062613/http://www.sgi.com/tech/stl/">the SGI STL</link>
      (the final merge was from
!     <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="https://web.archive.org/web/20171206110416/http://www.sgi.com/tech/stl/whats_new.html">release 3.3</link>).
      The code in libstdc++ contains many fixes and changes compared to the
      original SGI code.
      </para>
diff -Nrcpad gcc-14-20250606/libstdc++-v3/doc/xml/manual/containers.xml gcc-14-20250613/libstdc++-v3/doc/xml/manual/containers.xml
*** gcc-14-20250606/libstdc++-v3/doc/xml/manual/containers.xml	Fri Jun  6 22:34:02 2025
--- gcc-14-20250613/libstdc++-v3/doc/xml/manual/containers.xml	Fri Jun 13 22:33:27 2025
***************
*** 28,34 ****
       Yes it is, at least using the <link linkend="manual.intro.using.abi">old
       ABI</link>, and that's okay.  This is a decision that we preserved
       when we imported SGI's STL implementation.  The following is
!      quoted from <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="https://web.archive.org/web/20171225062613/http://www.sgi.com/tech/stl/FAQ.html">their FAQ</link>:
     </para>
     <blockquote>
       <para>
--- 28,34 ----
       Yes it is, at least using the <link linkend="manual.intro.using.abi">old
       ABI</link>, and that's okay.  This is a decision that we preserved
       when we imported SGI's STL implementation.  The following is
!      quoted from <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="https://web.archive.org/web/20161222192301/http://www.sgi.com/tech/stl/FAQ.html">their FAQ</link>:
     </para>
     <blockquote>
       <para>
diff -Nrcpad gcc-14-20250606/libstdc++-v3/doc/xml/manual/extensions.xml gcc-14-20250613/libstdc++-v3/doc/xml/manual/extensions.xml
*** gcc-14-20250606/libstdc++-v3/doc/xml/manual/extensions.xml	Fri Jun  6 22:34:02 2025
--- gcc-14-20250613/libstdc++-v3/doc/xml/manual/extensions.xml	Fri Jun 13 22:33:27 2025
*************** extensions, be aware of two things:
*** 227,238 ****
     </para>
     <para>Each of the associative containers map, multimap, set, and multiset
        have a counterpart which uses a
!       <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="https://web.archive.org/web/20171225062613/http://www.sgi.com/tech/stl/HashFunction.html">hashing
        function</link> to do the arranging, instead of a strict weak ordering
        function.  The classes take as one of their template parameters a
        function object that will return the hash value; by default, an
        instantiation of
!       <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="https://web.archive.org/web/20171225062613/http://www.sgi.com/tech/stl/hash.html">hash</link>.
        You should specialize this functor for your class, or define your own,
        before trying to use one of the hashing classes.
     </para>
--- 227,238 ----
     </para>
     <para>Each of the associative containers map, multimap, set, and multiset
        have a counterpart which uses a
!       <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="https://web.archive.org/web/20171230172024/http://www.sgi.com/tech/stl/HashFunction.html">hashing
        function</link> to do the arranging, instead of a strict weak ordering
        function.  The classes take as one of their template parameters a
        function object that will return the hash value; by default, an
        instantiation of
!       <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="https://web.archive.org/web/20171230172200/http://www.sgi.com/tech/stl/hash.html">hash</link>.
        You should specialize this functor for your class, or define your own,
        before trying to use one of the hashing classes.
     </para>
*************** get_temporary_buffer(5, (int*)0);
*** 394,400 ****
  </para>
  <para>The <code>iota</code> function wins the award for Extension With the
     Coolest Name (the name comes from Ken Iverson's APL language.)  As
!    described in the <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="https://web.archive.org/web/20171225062613/http://www.sgi.com/tech/stl/iota.html">SGI
     documentation</link>, it "assigns sequentially increasing values to a range.
     That is, it assigns <code>value</code> to <code>*first</code>,
     <code>value + 1</code> to<code> *(first + 1)</code> and so on."
--- 394,400 ----
  </para>
  <para>The <code>iota</code> function wins the award for Extension With the
     Coolest Name (the name comes from Ken Iverson's APL language.)  As
!    described in the <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="https://web.archive.org/web/20170201044840/http://www.sgi.com/tech/stl/iota.html">SGI
     documentation</link>, it "assigns sequentially increasing values to a range.
     That is, it assigns <code>value</code> to <code>*first</code>,
     <code>value + 1</code> to<code> *(first + 1)</code> and so on."
diff -Nrcpad gcc-14-20250606/libstdc++-v3/doc/xml/manual/using.xml gcc-14-20250613/libstdc++-v3/doc/xml/manual/using.xml
*** gcc-14-20250606/libstdc++-v3/doc/xml/manual/using.xml	Fri Jun  6 22:34:02 2025
--- gcc-14-20250613/libstdc++-v3/doc/xml/manual/using.xml	Fri Jun 13 22:33:27 2025
*************** The standard places requirements on the
*** 1929,1935 ****
  races are caused by the library itself or by programs which use the
  library correctly (as described below).
  The C++11 memory model and library requirements are a more formal version
! of the <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="https://web.archive.org/web/20171225062613/http://www.sgi.com/tech/stl/thread_safety.html">SGI STL</link> definition of thread safety, which the library used
  prior to the 2011 standard.
  </para>
  
--- 1929,1935 ----
  races are caused by the library itself or by programs which use the
  library correctly (as described below).
  The C++11 memory model and library requirements are a more formal version
! of the <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="https://web.archive.org/web/20171221154911/http://www.sgi.com/tech/stl/thread_safety.html">SGI STL</link> definition of thread safety, which the library used
  prior to the 2011 standard.
  </para>
  
*************** gcc version 4.1.2 20070925 (Red Hat 4.1.
*** 2214,2223 ****
     </para>
     <para>Two excellent pages to read when working with the Standard C++
        containers and threads are
!       <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="https://web.archive.org/web/20171225062613/http://www.sgi.com/tech/stl/thread_safety.html">SGI's
!       https://web.archive.org/web/20171225062613/http://www.sgi.com/tech/stl/thread_safety.html</link> and
!       <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="https://web.archive.org/web/20171225062613/http://www.sgi.com/tech/stl/Allocators.html">SGI's
!       https://web.archive.org/web/20171225062613/http://www.sgi.com/tech/stl/Allocators.html</link>.
     </para>
     <para><emphasis>However, please ignore all discussions about the user-level
        configuration of the lock implementation inside the STL
--- 2214,2223 ----
     </para>
     <para>Two excellent pages to read when working with the Standard C++
        containers and threads are
!       <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="https://web.archive.org/web/20171221154911/http://www.sgi.com/tech/stl/thread_safety.html">SGI's
!       https://web.archive.org/web/20171221154911/http://www.sgi.com/tech/stl/thread_safety.html</link> and
!       <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="https://web.archive.org/web/20171108142526/http://www.sgi.com/tech/stl/Allocators.html">SGI's
!       https://web.archive.org/web/20171108142526/http://www.sgi.com/tech/stl/Allocators.html</link>.
     </para>
     <para><emphasis>However, please ignore all discussions about the user-level
        configuration of the lock implementation inside the STL
diff -Nrcpad gcc-14-20250606/libstdc++-v3/doc/xml/manual/utilities.xml gcc-14-20250613/libstdc++-v3/doc/xml/manual/utilities.xml
*** gcc-14-20250606/libstdc++-v3/doc/xml/manual/utilities.xml	Fri Jun  6 22:34:02 2025
--- gcc-14-20250613/libstdc++-v3/doc/xml/manual/utilities.xml	Fri Jun 13 22:33:27 2025
***************
*** 22,29 ****
        get slightly the wrong idea.  In the interest of not reinventing
        the wheel, we will refer you to the introduction to the functor
        concept written by SGI as part of their STL, in
!       <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="https://web.archive.org/web/20171225062613/http://www.sgi.com/tech/stl/functors.html">their
!       https://web.archive.org/web/20171225062613/http://www.sgi.com/tech/stl/functors.html</link>.
     </para>
  </section>
  
--- 22,29 ----
        get slightly the wrong idea.  In the interest of not reinventing
        the wheel, we will refer you to the introduction to the functor
        concept written by SGI as part of their STL, in
!       <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="https://web.archive.org/web/20171209002754/http://www.sgi.com/tech/stl/functors.html">their
!       https://web.archive.org/web/20171209002754/http://www.sgi.com/tech/stl/functors.html</link>.
     </para>
  </section>
  
diff -Nrcpad gcc-14-20250606/libstdc++-v3/include/bits/chrono.h gcc-14-20250613/libstdc++-v3/include/bits/chrono.h
*** gcc-14-20250606/libstdc++-v3/include/bits/chrono.h	Fri Jun  6 22:34:02 2025
--- gcc-14-20250613/libstdc++-v3/include/bits/chrono.h	Fri Jun 13 22:33:27 2025
*************** _GLIBCXX_BEGIN_INLINE_ABI_NAMESPACE(_V2)
*** 1239,1244 ****
--- 1239,1245 ----
        now() noexcept;
  
        // Map to C API
+       [[__gnu__::__always_inline__]]
        static std::time_t
        to_time_t(const time_point& __t) noexcept
        {
*************** _GLIBCXX_BEGIN_INLINE_ABI_NAMESPACE(_V2)
*** 1246,1251 ****
--- 1247,1253 ----
  			   (__t.time_since_epoch()).count());
        }
  
+       [[__gnu__::__always_inline__]]
        static time_point
        from_time_t(std::time_t __t) noexcept
        {
diff -Nrcpad gcc-14-20250606/libstdc++-v3/include/std/format gcc-14-20250613/libstdc++-v3/include/std/format
*** gcc-14-20250606/libstdc++-v3/include/std/format	Fri Jun  6 22:34:02 2025
--- gcc-14-20250613/libstdc++-v3/include/std/format	Fri Jun 13 22:33:28 2025
*************** namespace __format
*** 1831,1855 ****
  	if (__grp.empty() && __point == __dot)
  	  return __lstr; // Locale uses '.' and no grouping.
  
! 	size_t __d = __str.find(__dot);
! 	size_t __e = min(__d, __str.find(__exp));
  	if (__e == __str.npos)
  	  __e = __str.size();
! 	const size_t __r = __str.size() - __e;
  	auto __overwrite = [&](_CharT* __p, size_t) {
! 	  auto __end = std::__add_grouping(__p, __np.thousands_sep(),
  					   __grp.data(), __grp.size(),
! 					   __str.data(), __str.data() + __e);
! 	  if (__r)
  	    {
  	      if (__d != __str.npos)
  		{
! 		  *__end = __point;
  		  ++__end;
  		  ++__e;
  		}
! 	      if (__r > 1)
! 		__end += __str.copy(__end, __str.npos, __e);
  	    }
  	  return (__end - __p);
  	};
--- 1831,1865 ----
  	if (__grp.empty() && __point == __dot)
  	  return __lstr; // Locale uses '.' and no grouping.
  
! 	size_t __d = __str.find(__dot); // Index of radix character (if any).
! 	size_t __e = min(__d, __str.find(__exp)); // First of radix or exponent
  	if (__e == __str.npos)
  	  __e = __str.size();
! 	const size_t __r = __str.size() - __e; // Length of remainder.
  	auto __overwrite = [&](_CharT* __p, size_t) {
! 	  // Apply grouping to the digits before the radix or exponent.
! 	  int __off = 0;
! 	  if (auto __c = __str.front(); __c == '-' || __c == '+' || __c == ' ')
! 	    {
! 	      *__p = __c;
! 	      __off = 1;
! 	    }
! 	  auto __end = std::__add_grouping(__p + __off, __np.thousands_sep(),
  					   __grp.data(), __grp.size(),
! 					   __str.data() + __off,
! 					   __str.data() + __e);
! 	  if (__r) // If there's a fractional part or exponent
  	    {
  	      if (__d != __str.npos)
  		{
! 		  *__end = __point; // Add the locale's radix character.
  		  ++__end;
  		  ++__e;
  		}
! 	      const size_t __rlen = __str.size() - __e;
! 	      // Append fractional digits and/or exponent:
! 	      char_traits<_CharT>::copy(__end, __str.data() + __e, __rlen);
! 	      __end += __rlen;
  	    }
  	  return (__end - __p);
  	};
diff -Nrcpad gcc-14-20250606/libstdc++-v3/testsuite/20_util/system_clock/99832.cc gcc-14-20250613/libstdc++-v3/testsuite/20_util/system_clock/99832.cc
*** gcc-14-20250606/libstdc++-v3/testsuite/20_util/system_clock/99832.cc	Thu Jan  1 00:00:00 1970
--- gcc-14-20250613/libstdc++-v3/testsuite/20_util/system_clock/99832.cc	Fri Jun 13 22:33:29 2025
***************
*** 0 ****
--- 1,14 ----
+ // { dg-options "-O0 -g0" }
+ // { dg-do compile { target c++20 } }
+ // { dg-final { scan-assembler-not "system_clock9to_time_t" } }
+ 
+ // Bug libstdc++/99832
+ // std::chrono::system_clock::to_time_t needs ABI tag for 32-bit time_t
+ 
+ #include <chrono>
+ 
+ std::time_t
+ test_pr99832(std::chrono::system_clock::time_point t)
+ {
+   return std::chrono::system_clock::to_time_t(t);
+ }
diff -Nrcpad gcc-14-20250606/libstdc++-v3/testsuite/std/format/functions/format.cc gcc-14-20250613/libstdc++-v3/testsuite/std/format/functions/format.cc
*** gcc-14-20250606/libstdc++-v3/testsuite/std/format/functions/format.cc	Fri Jun  6 22:34:18 2025
--- gcc-14-20250613/libstdc++-v3/testsuite/std/format/functions/format.cc	Fri Jun 13 22:33:33 2025
*************** test_locale()
*** 256,261 ****
--- 256,271 ----
    s = std::format(eloc, "{0:Le} {0:Lf} {0:Lg}", -nan);
    VERIFY( s == "-nan -nan -nan" );
  
+   // PR libstdc++/120548 format confuses a negative sign for a thousands digit
+   s = std::format(bloc, "{:L}", -123.45);
+   VERIFY( s == "-123.45" );
+   s = std::format(bloc, "{:-L}", -876543.21);
+   VERIFY( s == "-876,543.21" );
+   s = std::format(bloc, "{:+L}", 333.22);
+   VERIFY( s == "+333.22" );
+   s = std::format(bloc, "{: L}", 999.44);
+   VERIFY( s == " 999.44" );
+ 
    // Restore
    std::locale::global(cloc);
  }
