public inbox for gcc-patches@gcc.gnu.org
 help / color / mirror / Atom feed
* Ping on target independent stack clash protection patches
@ 2017-08-17  7:15 Jeff Law
  2017-08-18 19:21 ` Eric Botcazou
  0 siblings, 1 reply; 3+ messages in thread
From: Jeff Law @ 2017-08-17  7:15 UTC (permalink / raw)
  To: Richard Biener, Eric Botcazou; +Cc: gcc-patches


#01 of #08:
https://gcc.gnu.org/ml/gcc-patches/2017-07/msg01971.html

#02 of #08:
https://gcc.gnu.org/ml/gcc-patches/2017-07/msg01972.html

#03 of #08:
https://gcc.gnu.org/ml/gcc-patches/2017-07/msg01974.html

Need to reach some kind of closure on these, then I can start pinging
the target maintainers for the rest of the bits...

Jeff

^ permalink raw reply	[flat|nested] 3+ messages in thread

* Re: Ping on target independent stack clash protection patches
  2017-08-17  7:15 Ping on target independent stack clash protection patches Jeff Law
@ 2017-08-18 19:21 ` Eric Botcazou
  2017-09-08 21:58   ` Jeff Law
  0 siblings, 1 reply; 3+ messages in thread
From: Eric Botcazou @ 2017-08-18 19:21 UTC (permalink / raw)
  To: Jeff Law; +Cc: gcc-patches, Richard Biener

> #01 of #08:
> https://gcc.gnu.org/ml/gcc-patches/2017-07/msg01971.html
> 
> #02 of #08:
> https://gcc.gnu.org/ml/gcc-patches/2017-07/msg01972.html
> 
> #03 of #08:
> https://gcc.gnu.org/ml/gcc-patches/2017-07/msg01974.html
> 
> Need to reach some kind of closure on these, then I can start pinging
> the target maintainers for the rest of the bits...

All OK with me, thanks for your attention to the interaction with Ada.

Minor nit:

+   Stack checking is designed to detect infinite recursion for Ada
+   programs.  Furthermore stack checking tries to ensure that scenario
+   that enough stack space is left to run a signal handler.

Let's use the same wording as in invoke.texi: "...infinite recursion and stack 
overflows for...".  Missing "in" before "that scenario'.

[Ada folks in the embedded world are mainly scared about the possibility of 
tasks (threads) overwriting each other's stack; in that case, their only 
requirement is to be able to run a last chance handler to terminate the 
task properly.  But the ACATS testsuite contains a handul of tests that 
litteraly play with stack overflows and this complicates the implementation 
for artificial reasons].

-- 
Eric Botcazou

^ permalink raw reply	[flat|nested] 3+ messages in thread

* Re: Ping on target independent stack clash protection patches
  2017-08-18 19:21 ` Eric Botcazou
@ 2017-09-08 21:58   ` Jeff Law
  0 siblings, 0 replies; 3+ messages in thread
From: Jeff Law @ 2017-09-08 21:58 UTC (permalink / raw)
  To: Eric Botcazou; +Cc: gcc-patches, Richard Biener

On 08/18/2017 09:56 AM, Eric Botcazou wrote:
>> #01 of #08:
>> https://gcc.gnu.org/ml/gcc-patches/2017-07/msg01971.html
>>
>> #02 of #08:
>> https://gcc.gnu.org/ml/gcc-patches/2017-07/msg01972.html
>>
>> #03 of #08:
>> https://gcc.gnu.org/ml/gcc-patches/2017-07/msg01974.html
>>
>> Need to reach some kind of closure on these, then I can start pinging
>> the target maintainers for the rest of the bits...
> 
> All OK with me, thanks for your attention to the interaction with Ada.
> 
> Minor nit:
> 
> +   Stack checking is designed to detect infinite recursion for Ada
> +   programs.  Furthermore stack checking tries to ensure that scenario
> +   that enough stack space is left to run a signal handler.
> 
> Let's use the same wording as in invoke.texi: "...infinite recursion and stack 
> overflows for...".  Missing "in" before "that scenario'.
Both nits fixed.


Jeff

^ permalink raw reply	[flat|nested] 3+ messages in thread

end of thread, other threads:[~2017-09-08 21:58 UTC | newest]

Thread overview: 3+ messages (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
2017-08-17  7:15 Ping on target independent stack clash protection patches Jeff Law
2017-08-18 19:21 ` Eric Botcazou
2017-09-08 21:58   ` Jeff Law

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).