* [COMMITTED] ada: Simplify lookup of predecessor in homonym chain
@ 2023-05-15 9:43 Marc Poulhiès
0 siblings, 0 replies; only message in thread
From: Marc Poulhiès @ 2023-05-15 9:43 UTC (permalink / raw)
To: gcc-patches; +Cc: Ronan Desplanques
From: Ronan Desplanques <desplanques@adacore.com>
gcc/ada/
* sem_ch8.adb (End_Scope): Simplify lookup of predecessor in
homonym chain.
Tested on x86_64-pc-linux-gnu, committed on master.
---
gcc/ada/sem_ch8.adb | 3 +--
1 file changed, 1 insertion(+), 2 deletions(-)
diff --git a/gcc/ada/sem_ch8.adb b/gcc/ada/sem_ch8.adb
index 6f858eea0f9..e4b3519bbaa 100644
--- a/gcc/ada/sem_ch8.adb
+++ b/gcc/ada/sem_ch8.adb
@@ -5066,7 +5066,6 @@ package body Sem_Ch8 is
if Id /= Current_Entity (Id) then
Prev := Current_Entity (Id);
while Present (Prev)
- and then Present (Homonym (Prev))
and then Homonym (Prev) /= Id
loop
Prev := Homonym (Prev);
@@ -5074,7 +5073,7 @@ package body Sem_Ch8 is
-- Skip to end of loop if Id is not in the visibility chain
- if No (Prev) or else Homonym (Prev) /= Id then
+ if No (Prev) then
goto Next_Ent;
end if;
--
2.40.0
^ permalink raw reply [flat|nested] only message in thread
only message in thread, other threads:[~2023-05-15 9:43 UTC | newest]
Thread overview: (only message) (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
2023-05-15 9:43 [COMMITTED] ada: Simplify lookup of predecessor in homonym chain Marc Poulhiès
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).