[gcc(refs/users/marxin/heads/slp-entire-bb)] Daily bump.
Martin Liska
marxin@gcc.gnu.org
Wed Jul 29 07:01:45 GMT 2020
https://gcc.gnu.org/g:7ebb7d0ce1a11e5b1d2174798482d2bb7f307c82
commit 7ebb7d0ce1a11e5b1d2174798482d2bb7f307c82
Author: GCC Administrator <gccadmin@gcc.gnu.org>
Date: Wed Jul 29 00:16:24 2020 +0000
Daily bump.
Diff:
---
gcc/ChangeLog | 36 ++++++++++++++++++++++++++++++++++++
gcc/DATESTAMP | 2 +-
gcc/cp/ChangeLog | 29 +++++++++++++++++++++++++++++
gcc/testsuite/ChangeLog | 49 +++++++++++++++++++++++++++++++++++++++++++++++++
libcpp/ChangeLog | 11 +++++++++++
libstdc++-v3/ChangeLog | 20 ++++++++++++++++++++
6 files changed, 146 insertions(+), 1 deletion(-)
diff --git a/gcc/ChangeLog b/gcc/ChangeLog
index 73fd1e2772a..46d963e3236 100644
--- a/gcc/ChangeLog
+++ b/gcc/ChangeLog
@@ -1,3 +1,39 @@
+2020-07-28 Sergei Trofimovich <siarheit@google.com>
+
+ PR ipa/96291
+ * ipa-cp.c (has_undead_caller_from_outside_scc_p): Consider
+ unoptimized callers as undead.
+
+2020-07-28 Roger Sayle <roger@nextmovesoftware.com>
+ Richard Biener <rguenther@suse.de>
+
+ * match.pd (popcount(x)&1 -> parity(x)): New simplification.
+ (parity(~x) -> parity(x)): New simplification.
+ (parity(x)^parity(y) -> parity(x^y)): New simplification.
+ (parity(x&1) -> x&1): New simplification.
+ (popcount(x) -> x>>C): New simplification.
+
+2020-07-28 Roger Sayle <roger@nextmovesoftware.com>
+ Tom de Vries <tdevries@suse.de>
+
+ * config/nvptx/nvptx.md (extendqihi2): New instruction.
+ (ashl<mode>3, ashr<mode>3, lshr<mode>3): Support HImode.
+
+2020-07-28 Jakub Jelinek <jakub@redhat.com>
+
+ PR middle-end/96335
+ * calls.c (maybe_warn_rdwr_sizes): Add FNDECL and FNTYPE arguments,
+ instead of trying to rediscover them in the body.
+ (initialize_argument_information): Adjust caller.
+
+2020-07-28 Kewen Lin <linkw@linux.ibm.com>
+
+ * tree-vect-loop.c (vect_get_known_peeling_cost): Factor out some code
+ to determine peel_iters_epilogue to...
+ (vect_get_peel_iters_epilogue): ...this new function.
+ (vect_estimate_min_profitable_iters): Refactor cost calculation on
+ peel_iters_prologue and peel_iters_epilogue.
+
2020-07-27 Martin Sebor <msebor@redhat.com>
PR tree-optimization/84079
diff --git a/gcc/DATESTAMP b/gcc/DATESTAMP
index 75ec474bf8f..273bf0e001a 100644
--- a/gcc/DATESTAMP
+++ b/gcc/DATESTAMP
@@ -1 +1 @@
-20200728
+20200729
diff --git a/gcc/cp/ChangeLog b/gcc/cp/ChangeLog
index 2ce7552d36f..eb256521805 100644
--- a/gcc/cp/ChangeLog
+++ b/gcc/cp/ChangeLog
@@ -1,3 +1,32 @@
+2020-07-28 Nathan Sidwell <nathan@acm.org>
+
+ * cp-gimplify.c (cp_genericize_r): Set IMPORTED_DECL's context.
+ * cp-objcp-common.c (cp_pushdecl): Set decl's context.
+ * decl.c (grokfndecl): Make DECL_CONTEXT setting clearer.
+
+2020-07-28 Nathan Sidwell <nathan@acm.org>
+
+ * class.c (fixup_type_variants): Copy TYPE_SIZE and
+ TYPE_SIZE_UINIT.
+ (finish_struct): Call it.
+
+2020-07-28 Nathan Sidwell <nathan@acm.org>
+
+ * ptree.c (cxx_print_decl): Better indentation.
+
+2020-07-28 Jakub Jelinek <jakub@redhat.com>
+ Mark Wielaard <mark@klomp.org>
+
+ PR c++/96328
+ * parser.c (cp_lexer_safe_previous_token): Don't call
+ cp_lexer_previous_token, instead inline it by hand and return NULL
+ instead of failing assertion if all previous tokens until the first
+ one are purged.
+ (cp_parser_error_1): Optimize - only call cp_lexer_safe_previous_token
+ if token->type is CPP_NAME. Use cp_lexer_safe_previous_token instead
+ of cp_lexer_previous_token for the missing_token_desc != RT_NONE
+ case too.
+
2020-07-27 Nathan Sidwell <nathan@acm.org>
* cp-tree.h (enum cp_tree_index): Add CPTI_AS_BASE_IDENTIFIER.
diff --git a/gcc/testsuite/ChangeLog b/gcc/testsuite/ChangeLog
index f900b67ec66..bcee4187a5a 100644
--- a/gcc/testsuite/ChangeLog
+++ b/gcc/testsuite/ChangeLog
@@ -1,3 +1,52 @@
+2020-07-28 Sergei Trofimovich <siarheit@google.com>
+
+ PR ipa/96291
+ * gcc.dg/lto/pr96291_0.c: New testcase.
+ * gcc.dg/lto/pr96291_1.c: Support file.
+ * gcc.dg/lto/pr96291_2.c: Likewise.
+ * gcc.dg/lto/pr96291.h: Likewise.
+
+2020-07-28 Roger Sayle <roger@nextmovesoftware.com>
+ Richard Biener <rguenther@suse.de>
+
+ * gcc.dg/fold-popcount-5.c: New test.
+ * gcc.dg/fold-parity-1.c: Likewise.
+ * gcc.dg/fold-parity-2.c: Likewise.
+ * gcc.dg/fold-parity-3.c: Likewise.
+ * gcc.dg/fold-parity-4.c: Likewise.
+ * gcc.dg/fold-parity-5.c: Likewise.
+
+2020-07-28 Nathan Sidwell <nathan@acm.org>
+
+ * lib/options.exp: Fix spello
+
+2020-07-28 Jakub Jelinek <jakub@redhat.com>
+ Mark Wielaard <mark@klomp.org>
+
+ PR c++/96328
+ * g++.dg/diagnostic/pr96328.C: New test.
+
+2020-07-28 Jakub Jelinek <jakub@redhat.com>
+
+ PR preprocessor/96323
+ * c-c++-common/cpp/pr96323.c: New test.
+
+2020-07-28 Roger Sayle <roger@nextmovesoftware.com>
+ Tom de Vries <tdevries@suse.de>
+
+ * gcc.target/nvptx/cvt.c: New test.
+ * gcc.target/nvptx/shift16.c: New test.
+
+2020-07-28 Jakub Jelinek <jakub@redhat.com>
+
+ * g++.dg/cpp2a/nontype-subob1.C: Allow s1, i1 or x1 instead of l1 for
+ targets with short, int or long long ssize_t.
+
+2020-07-28 Jakub Jelinek <jakub@redhat.com>
+
+ PR middle-end/96335
+ * gcc.dg/pr96335.c: New test.
+
2020-07-27 Hans-Peter Nilsson <hp@bitrange.com>
* gcc.dg/torture/pr39074-2.c: Adjust for mmix.
diff --git a/libcpp/ChangeLog b/libcpp/ChangeLog
index 0a1892e6b3f..ddc0700670c 100644
--- a/libcpp/ChangeLog
+++ b/libcpp/ChangeLog
@@ -1,3 +1,14 @@
+2020-07-28 Jakub Jelinek <jakub@redhat.com>
+
+ PR preprocessor/96323
+ * lex.c (lex_raw_string): For c == '\n' don't continue after reporting
+ an prefix delimiter error.
+
+2020-07-28 Nathan Sidwell <nathan@acm.org>
+
+ * init.c (cpp_read_main_file): Always use the last map for
+ the return value.
+
2020-07-20 Nathan Sidwell <nathan@acm.org>
* line-map.c (linemap_add): Simplify column overflow calculation.
diff --git a/libstdc++-v3/ChangeLog b/libstdc++-v3/ChangeLog
index 70d594f74d5..e361cf461e6 100644
--- a/libstdc++-v3/ChangeLog
+++ b/libstdc++-v3/ChangeLog
@@ -1,3 +1,23 @@
+2020-07-28 François Dumont <fdumont@gcc.gnu.org>
+
+ * include/bits/hashtable.h
+ (_Hashtable<>(_InputIterator, _InputIterator, size_t, const _H1&,
+ const _H2&, const _Hash&, const _Equal&, const _ExtractKey&,
+ const allocator_type&, true_type)): New.
+ (_Hashtable<>(_InputIterator, _InputIterator, size_t, const _H1&,
+ const _H2&, const _Hash&, const _Equal&, const _ExtractKey&,
+ const allocator_type&, false_type)): New.
+ (_Hashtable<>(_InputIterator, _InputIterator, size_t, const _H1&,
+ const _H2&, const _Hash&, const _Equal&, const _ExtractKey&,
+ const allocator_type&)): Delegate to latters.
+ (operator=(initializer_list<value_type>)): Rehash if too small.
+ (_M_insert(_Arg&&, const _NodeGenerator&, true_type)): Remove
+ size_t len parameter.
+ * include/bits/hashtable_policy.h (_Insert_base<>::_M_insert_range):
+ Do not try to get input range distance.
+ * testsuite/23_containers/unordered_set/cons/bucket_hint.cc: New test.
+ * testsuite/23_containers/unordered_set/modifiers/insert.cc: New test.
+
2020-07-27 François Dumont <fdumont@gcc.gnu.org>
* include/bits/hashtable_policy.h (_Map_base<>::at): Use
More information about the Libstdc++-cvs
mailing list