From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00 autolearn=ham autolearn_force=no version=3.4.4 X-Google-Thread: 103376,6c7dea22b75ba442 X-Google-Attributes: gid103376,public,usenet X-Google-Language: ENGLISH,ASCII-7-bit Path: g2news1.google.com!news3.google.com!feeder1-2.proxad.net!proxad.net!feeder2-2.proxad.net!newsfeed.arcor.de!newsspool2.arcor-online.net!news.arcor.de.POSTED!not-for-mail Newsgroups: comp.lang.ada Subject: Re: ada compiler? From: Georg Bauhaus In-Reply-To: <1195058211.682783.288340@d55g2000hsg.googlegroups.com> References: <1194747665.6151.31.camel@K72> <_evZi.177931$Xa3.50640@attbi_s22> <87hcjq46t4.fsf@ludovic-brenta.org> <473abc9d$0$13104$9b4e6d93@newsspool2.arcor-online.net> <1195035988.599522.87580@50g2000hsm.googlegroups.com> <1195043147.1007.263.camel@kartoffel> <1195052954.315227.220840@o3g2000hsb.googlegroups.com> <1195056238.1007.317.camel@kartoffel> <1195058211.682783.288340@d55g2000hsg.googlegroups.com> Content-Type: text/plain Content-Transfer-Encoding: 7bit Message-Id: <1195061973.1007.342.camel@kartoffel> Mime-Version: 1.0 X-Mailer: Evolution 2.10.1 Date: Wed, 14 Nov 2007 18:39:33 +0100 Organization: Arcor NNTP-Posting-Date: 14 Nov 2007 18:38:33 CET NNTP-Posting-Host: 19e16f6e.newsspool2.arcor-online.net X-Trace: DXC=^7fe9:[mG=LAa;:RKVJ>LEA9EHlD;3YcB4Fo<]lROoRA4nDHegD_]REbdcbo9ZMLV@N[W On Wed, 2007-11-14 at 08:36 -0800, Ludovic Brenta wrote: > Heap overflows > are different, of course, and are not affected by -fstack-check. Your > latest example was a heap overflow and therefore off-topic. Heap overflow seems entirely unrelated at first sight, but in two ways it needs to be considered here, I think. First, the -fstack-check warning suggests, in a sense, to use allocators and pointers instead of direct objects. When a programmer interprets the warning this way and starts using pointers, -f[no]-stack-check is likely to affect the structure of his/her Ada program. Second, there is a limit to the *sum* of stack memory and heap memory. ;-) Whatever that means at an implementation level. > Does someone here know GNAT internals in sufficient detail as to > enlighten us? Also can someone explain what "reliable" stack checking > is in GNAT parlance? I 2nd the request.