From: Richard Biener <richard.guenther@gmail.com>
To: Alexandre Oliva <oliva@adacore.com>
Cc: "Martin Liška" <mliska@suse.cz>, gcc-patches@gcc.gnu.org
Subject: Re: [16/17] check hash table counts at expand
Date: Mon, 9 Jan 2023 08:46:45 +0100 [thread overview]
Message-ID: <CAFiYyc0Av_Q+C5xaRDVnnmQR821vH+UQx1p82hpAafDKobVD0Q@mail.gmail.com> (raw)
In-Reply-To: <or1qojelwj.fsf_-_@lxoliva.fsfla.org>
On Wed, Dec 28, 2022 at 1:47 PM Alexandre Oliva via Gcc-patches
<gcc-patches@gcc.gnu.org> wrote:
>
> On Dec 28, 2022, Martin Liška <mliska@suse.cz> wrote:
>
> > I really like the verification code you added. It's quite similar to what
> > I added to hash-table.h:
>
> *nod*
>
> Prompted by your encouragement, I've combined the element count
> verification code with the verify() loop, and also added it to expand,
> where it can be done cheaply.
>
>
> Add cheap verification of element and deleted entry counts during
> expand and hash verify.
>
> Regstrapped on x86_64-linux-gnu. Ok to install?
OK.
>
> for gcc/ChangeLog
>
> * hash-table.h (expand): Check elements and deleted counts.
> (verify): Likewise.
> ---
> gcc/hash-table.h | 35 ++++++++++++++++++++++++++++-------
> 1 file changed, 28 insertions(+), 7 deletions(-)
>
> diff --git a/gcc/hash-table.h b/gcc/hash-table.h
> index 53507daae26c3..f4bda6102323e 100644
> --- a/gcc/hash-table.h
> +++ b/gcc/hash-table.h
> @@ -805,19 +805,28 @@ hash_table<Descriptor, Lazy, Allocator>::expand ()
> hash_table_usage ().release_instance_overhead (this, sizeof (value_type)
> * osize);
>
> + size_t n_deleted = m_n_deleted;
> +
> m_entries = nentries;
> m_size = nsize;
> m_size_prime_index = nindex;
> m_n_elements -= m_n_deleted;
> m_n_deleted = 0;
>
> + size_t n_elements = m_n_elements;
> +
> value_type *p = oentries;
> do
> {
> value_type &x = *p;
>
> - if (!is_empty (x) && !is_deleted (x))
> + if (is_empty (x))
> + ;
> + else if (is_deleted (x))
> + n_deleted--;
> + else
> {
> + n_elements--;
> value_type *q = find_empty_slot_for_expand (Descriptor::hash (x));
> new ((void*) q) value_type (std::move (x));
> /* After the resources of 'x' have been moved to a new object at 'q',
> @@ -829,6 +838,8 @@ hash_table<Descriptor, Lazy, Allocator>::expand ()
> }
> while (p < olimit);
>
> + gcc_checking_assert (!n_elements && !n_deleted);
> +
> if (!m_ggc)
> Allocator <value_type> ::data_free (oentries);
> else
> @@ -1018,8 +1029,9 @@ hash_table<Descriptor, Lazy, Allocator>
> return &m_entries[index];
> }
>
> -/* Verify that all existing elements in th hash table which are
> - equal to COMPARABLE have an equal HASH value provided as argument. */
> +/* Verify that all existing elements in the hash table which are
> + equal to COMPARABLE have an equal HASH value provided as argument.
> + Also check that the hash table element counts are correct. */
>
> template<typename Descriptor, bool Lazy,
> template<typename Type> class Allocator>
> @@ -1027,14 +1039,23 @@ void
> hash_table<Descriptor, Lazy, Allocator>
> ::verify (const compare_type &comparable, hashval_t hash)
> {
> + size_t n_elements = m_n_elements;
> + size_t n_deleted = m_n_deleted;
> for (size_t i = 0; i < MIN (hash_table_sanitize_eq_limit, m_size); i++)
> {
> value_type *entry = &m_entries[i];
> - if (!is_empty (*entry) && !is_deleted (*entry)
> - && hash != Descriptor::hash (*entry)
> - && Descriptor::equal (*entry, comparable))
> - hashtab_chk_error ();
> + if (!is_empty (*entry))
> + {
> + n_elements--;
> + if (is_deleted (*entry))
> + n_deleted--;
> + else if (hash != Descriptor::hash (*entry)
> + && Descriptor::equal (*entry, comparable))
> + hashtab_chk_error ();
> + }
> }
> + if (hash_table_sanitize_eq_limit >= m_size)
> + gcc_checking_assert (!n_elements && !n_deleted);
> }
>
> /* This function deletes an element with the given COMPARABLE value
>
>
> --
> Alexandre Oliva, happy hacker https://FSFLA.org/blogs/lxo/
> Free Software Activist GNU Toolchain Engineer
> Disinformation flourishes because many people care deeply about injustice
> but very few check the facts. Ask me about <https://stallmansupport.org>
next prev parent reply other threads:[~2023-01-09 7:47 UTC|newest]
Thread overview: 44+ messages / expand[flat|nested] mbox.gz Atom feed top
2022-12-27 4:07 [00/13] check hash table counts Alexandre Oliva
2022-12-27 4:17 ` [01/13] scoped tables: insert before further lookups Alexandre Oliva
2022-12-27 15:11 ` Jeff Law
2022-12-27 4:18 ` [02/13] varpool: do not add NULL vnodes to referenced Alexandre Oliva
2022-12-27 15:14 ` Jeff Law
2022-12-27 4:19 ` [03/13] tree-inline decl_map: skip mapping NULL to itself Alexandre Oliva
2022-12-27 15:15 ` Jeff Law
2022-12-27 4:21 ` [04/13] [C++] constraint: insert norm entry once Alexandre Oliva
2022-12-27 15:37 ` Jeff Law
2022-12-27 4:22 ` [05/13] ssa-loop-niter: skip caching of null operands Alexandre Oliva
2022-12-27 15:19 ` Jeff Law
2022-12-28 4:03 ` Alexandre Oliva
2022-12-27 4:23 ` [06/13] tree-inline decl_map: skip mapping result's NULL default def Alexandre Oliva
2022-12-27 15:23 ` Jeff Law
2022-12-27 4:24 ` [07/13] postreload-gcse: no insert on mere lookup Alexandre Oliva
2022-12-27 15:11 ` Jeff Law
2022-12-27 4:28 ` [08/13] tm: complete tm_restart insertion Alexandre Oliva
2022-12-27 15:27 ` Jeff Law
2022-12-27 4:30 ` [09/13] [C++] constexpr: request insert iff depth is ok Alexandre Oliva
2022-12-27 15:38 ` Jeff Law
2022-12-27 4:35 ` [10/13] lto: drop dummy partition mapping Alexandre Oliva
2022-12-27 15:34 ` Jeff Law
2022-12-27 4:38 ` [11/13] ada: don't map NULL decl to locus Alexandre Oliva
2022-12-27 15:33 ` Jeff Law
2022-12-27 16:54 ` Arnaud Charlet
2022-12-27 4:38 ` [12/13] hash set: reject attempts to add empty values Alexandre Oliva
2022-12-27 15:30 ` Jeff Law
2022-12-27 4:39 ` [13/13] hash-map: reject empty-looking insertions Alexandre Oliva
2022-12-27 15:31 ` Jeff Law
2022-12-27 17:53 ` David Malcolm
2022-12-28 12:32 ` [15/17] prevent hash set/map insertion of deleted entries Alexandre Oliva
2022-12-29 4:25 ` Jeff Law
2022-12-28 8:50 ` [00/13] check hash table counts Martin Liška
2022-12-28 12:46 ` [16/17] check hash table counts at expand Alexandre Oliva
2023-01-09 7:46 ` Richard Biener [this message]
2022-12-28 12:30 ` [14/17] parloops: don't request insert that won't be completed Alexandre Oliva
2022-12-29 2:44 ` Jeff Law
2022-12-28 12:50 ` [17/17] check hash table insertions Alexandre Oliva
2022-12-28 14:20 ` Richard Biener
2022-12-28 23:06 ` Alexandre Oliva
2022-12-29 7:29 ` Richard Biener
2022-12-30 8:53 ` Alexandre Oliva
2022-12-30 11:30 ` Richard Biener
2022-12-30 16:41 ` Alexandre Oliva
Reply instructions:
You may reply publicly to this message via plain-text email
using any one of the following methods:
* Save the following mbox file, import it into your mail client,
and reply-to-all from there: mbox
Avoid top-posting and favor interleaved quoting:
https://en.wikipedia.org/wiki/Posting_style#Interleaved_style
* Reply using the --to, --cc, and --in-reply-to
switches of git-send-email(1):
git send-email \
--in-reply-to=CAFiYyc0Av_Q+C5xaRDVnnmQR821vH+UQx1p82hpAafDKobVD0Q@mail.gmail.com \
--to=richard.guenther@gmail.com \
--cc=gcc-patches@gcc.gnu.org \
--cc=mliska@suse.cz \
--cc=oliva@adacore.com \
/path/to/YOUR_REPLY
https://kernel.org/pub/software/scm/git/docs/git-send-email.html
* If your mail client supports setting the In-Reply-To header
via mailto: links, try the mailto: link
Be sure your reply has a Subject: header at the top and a blank line
before the message body.
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for read-only IMAP folder(s) and NNTP newsgroup(s).