From 4e9f6c14280699997a633cefd3fb315b2bd4762c Mon Sep 17 00:00:00 2001 From: Richard Sandiford Date: Thu, 29 Jun 2023 08:48:17 +0100 Subject: [PATCH] A couple of va_gc_atomic tweaks MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit The only current user of va_gc_atomic is Ada's: vec It uses the generic gt_pch_nx routines (with gt_pch_nx being the “note pointers” hooks), such as: template void gt_pch_nx (vec *v) { extern void gt_pch_nx (T &); for (unsigned i = 0; i < v->length (); i++) gt_pch_nx ((*v)[i]); } It then defines gt_pch_nx routines for Entity_Id &. The problem is that if we wanted to take the same approach for an array of unsigned ints, we'd need to define: inline void gt_pch_nx (unsigned int &) { } which would then be ambiguous with: inline void gt_pch_nx (unsigned int) { } The point of va_gc_atomic is that the elements don't need to be GCed, and so we have: template void gt_ggc_mx (vec *v ATTRIBUTE_UNUSED) { /* Nothing to do. Vectors of atomic types wrt GC do not need to be traversed. */ } I think it's therefore reasonable to assume that no pointers will need to be processed for PCH either. The patch also relaxes the array_slice constructor for vec * so that it handles all embedded vectors. gcc/ * vec.h (gt_pch_nx): Add overloads for va_gc_atomic. (array_slice): Relax va_gc constructor to handle all vectors with a vl_embed layout. gcc/ada/ * gcc-interface/decl.cc (gt_pch_nx): Remove overloads for Entity_Id. --- gcc/ada/gcc-interface/decl.cc | 11 ----------- gcc/vec.h | 22 ++++++++++++++++++---- 2 files changed, 18 insertions(+), 15 deletions(-) diff --git a/gcc/ada/gcc-interface/decl.cc b/gcc/ada/gcc-interface/decl.cc index 494b24e2111..ee913a017d2 100644 --- a/gcc/ada/gcc-interface/decl.cc +++ b/gcc/ada/gcc-interface/decl.cc @@ -163,17 +163,6 @@ struct GTY((for_user)) tree_entity_vec_map vec *to; }; -void -gt_pch_nx (Entity_Id &) -{ -} - -void -gt_pch_nx (Entity_Id *x, gt_pointer_operator op, void *cookie) -{ - op (x, NULL, cookie); -} - struct dummy_type_hasher : ggc_cache_ptr_hash { static inline hashval_t diff --git a/gcc/vec.h b/gcc/vec.h index 36918915701..6f7b0487eb6 100644 --- a/gcc/vec.h +++ b/gcc/vec.h @@ -1390,6 +1390,13 @@ gt_pch_nx (vec *v) gt_pch_nx ((*v)[i]); } +template +void +gt_pch_nx (vec *) +{ + /* No pointers to note. */ +} + template void gt_pch_nx (vec *v, gt_pointer_operator op, void *cookie) @@ -1407,6 +1414,13 @@ gt_pch_nx (vec *v, gt_pointer_operator op, void *cookie) gt_pch_nx (&((*v)[i]), op, cookie); } +template +void +gt_pch_nx (vec *, gt_pointer_operator, void *) +{ + /* No pointers to note. */ +} + /* Space efficient vector. These vectors can grow dynamically and are allocated together with their control data. They are suited to be @@ -2286,12 +2300,12 @@ public: array_slice (vec &v) : m_base (v.address ()), m_size (v.length ()) {} - template - array_slice (const vec *v) + template + array_slice (const vec *v) : m_base (v ? v->address () : nullptr), m_size (v ? v->length () : 0) {} - template - array_slice (vec *v) + template + array_slice (vec *v) : m_base (v ? v->address () : nullptr), m_size (v ? v->length () : 0) {} iterator begin () { return m_base; }