public inbox for gcc-cvs@sourceware.org
help / color / mirror / Atom feed
* [gcc(refs/users/aoliva/heads/testme)] hash table: insert before further lookups
@ 2022-12-23 5:26 Alexandre Oliva
0 siblings, 0 replies; 3+ messages in thread
From: Alexandre Oliva @ 2022-12-23 5:26 UTC (permalink / raw)
To: gcc-cvs
https://gcc.gnu.org/g:08df3b23b8f36e2388ae648dde07b4b17a69fa9a
commit 08df3b23b8f36e2388ae648dde07b4b17a69fa9a
Author: Alexandre Oliva <oliva@gnu.org>
Date: Thu Dec 22 21:28:47 2022 -0300
hash table: insert before further lookups
Diff:
---
gcc/tree-ssa-scopedtables.cc | 10 +++++-----
1 file changed, 5 insertions(+), 5 deletions(-)
diff --git a/gcc/tree-ssa-scopedtables.cc b/gcc/tree-ssa-scopedtables.cc
index 6d203ef89ec..3e6e129e7d5 100644
--- a/gcc/tree-ssa-scopedtables.cc
+++ b/gcc/tree-ssa-scopedtables.cc
@@ -259,11 +259,6 @@ avail_exprs_stack::lookup_avail_expr (gimple *stmt, bool insert, bool tbaa_p,
}
else if (*slot == NULL)
{
- /* If we did not find the expression in the hash table, we may still
- be able to produce a result for some expressions. */
- tree retval = avail_exprs_stack::simplify_binary_operation (stmt,
- element);
-
/* We have, in effect, allocated *SLOT for ELEMENT at this point.
We must initialize *SLOT to a real entry, even if we found a
way to prove ELEMENT was a constant after not finding ELEMENT
@@ -277,6 +272,11 @@ avail_exprs_stack::lookup_avail_expr (gimple *stmt, bool insert, bool tbaa_p,
class expr_hash_elt *element2 = new expr_hash_elt (element);
*slot = element2;
+ /* If we did not find the expression in the hash table, we may still
+ be able to produce a result for some expressions. */
+ tree retval = avail_exprs_stack::simplify_binary_operation (stmt,
+ element);
+
record_expr (element2, NULL, '2');
return retval;
}
^ permalink raw reply [flat|nested] 3+ messages in thread
* [gcc(refs/users/aoliva/heads/testme)] hash table: insert before further lookups
@ 2022-12-23 7:31 Alexandre Oliva
0 siblings, 0 replies; 3+ messages in thread
From: Alexandre Oliva @ 2022-12-23 7:31 UTC (permalink / raw)
To: gcc-cvs
https://gcc.gnu.org/g:ace790a4e8118145be1f870299983715a092d6c1
commit ace790a4e8118145be1f870299983715a092d6c1
Author: Alexandre Oliva <oliva@gnu.org>
Date: Thu Dec 22 21:28:47 2022 -0300
hash table: insert before further lookups
Diff:
---
gcc/tree-ssa-scopedtables.cc | 10 +++++-----
1 file changed, 5 insertions(+), 5 deletions(-)
diff --git a/gcc/tree-ssa-scopedtables.cc b/gcc/tree-ssa-scopedtables.cc
index 6d203ef89ec..3e6e129e7d5 100644
--- a/gcc/tree-ssa-scopedtables.cc
+++ b/gcc/tree-ssa-scopedtables.cc
@@ -259,11 +259,6 @@ avail_exprs_stack::lookup_avail_expr (gimple *stmt, bool insert, bool tbaa_p,
}
else if (*slot == NULL)
{
- /* If we did not find the expression in the hash table, we may still
- be able to produce a result for some expressions. */
- tree retval = avail_exprs_stack::simplify_binary_operation (stmt,
- element);
-
/* We have, in effect, allocated *SLOT for ELEMENT at this point.
We must initialize *SLOT to a real entry, even if we found a
way to prove ELEMENT was a constant after not finding ELEMENT
@@ -277,6 +272,11 @@ avail_exprs_stack::lookup_avail_expr (gimple *stmt, bool insert, bool tbaa_p,
class expr_hash_elt *element2 = new expr_hash_elt (element);
*slot = element2;
+ /* If we did not find the expression in the hash table, we may still
+ be able to produce a result for some expressions. */
+ tree retval = avail_exprs_stack::simplify_binary_operation (stmt,
+ element);
+
record_expr (element2, NULL, '2');
return retval;
}
^ permalink raw reply [flat|nested] 3+ messages in thread
* [gcc(refs/users/aoliva/heads/testme)] hash table: insert before further lookups
@ 2022-12-23 0:57 Alexandre Oliva
0 siblings, 0 replies; 3+ messages in thread
From: Alexandre Oliva @ 2022-12-23 0:57 UTC (permalink / raw)
To: gcc-cvs
https://gcc.gnu.org/g:805feed9366806f7ff54c2a3d3f9d31131df8013
commit 805feed9366806f7ff54c2a3d3f9d31131df8013
Author: Alexandre Oliva <oliva@gnu.org>
Date: Thu Dec 22 21:28:47 2022 -0300
hash table: insert before further lookups
Diff:
---
gcc/tree-ssa-scopedtables.cc | 10 +++++-----
1 file changed, 5 insertions(+), 5 deletions(-)
diff --git a/gcc/tree-ssa-scopedtables.cc b/gcc/tree-ssa-scopedtables.cc
index 6d203ef89ec..3e6e129e7d5 100644
--- a/gcc/tree-ssa-scopedtables.cc
+++ b/gcc/tree-ssa-scopedtables.cc
@@ -259,11 +259,6 @@ avail_exprs_stack::lookup_avail_expr (gimple *stmt, bool insert, bool tbaa_p,
}
else if (*slot == NULL)
{
- /* If we did not find the expression in the hash table, we may still
- be able to produce a result for some expressions. */
- tree retval = avail_exprs_stack::simplify_binary_operation (stmt,
- element);
-
/* We have, in effect, allocated *SLOT for ELEMENT at this point.
We must initialize *SLOT to a real entry, even if we found a
way to prove ELEMENT was a constant after not finding ELEMENT
@@ -277,6 +272,11 @@ avail_exprs_stack::lookup_avail_expr (gimple *stmt, bool insert, bool tbaa_p,
class expr_hash_elt *element2 = new expr_hash_elt (element);
*slot = element2;
+ /* If we did not find the expression in the hash table, we may still
+ be able to produce a result for some expressions. */
+ tree retval = avail_exprs_stack::simplify_binary_operation (stmt,
+ element);
+
record_expr (element2, NULL, '2');
return retval;
}
^ permalink raw reply [flat|nested] 3+ messages in thread
end of thread, other threads:[~2022-12-23 7:31 UTC | newest]
Thread overview: 3+ messages (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
2022-12-23 5:26 [gcc(refs/users/aoliva/heads/testme)] hash table: insert before further lookups Alexandre Oliva
-- strict thread matches above, loose matches on Subject: below --
2022-12-23 7:31 Alexandre Oliva
2022-12-23 0:57 Alexandre Oliva
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).