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,2cb1f0b6d642e1dc X-Google-NewGroupId: yes X-Google-Attributes: gida07f3367d7,domainid0,public,usenet X-Google-Language: ENGLISH,ASCII-7-bit Path: g2news2.google.com!news2.google.com!newsfeed2.dallas1.level3.net!newsfeed3.dallas1.level3.net!news.level3.com!bloom-beacon.mit.edu!newsswitch.lcs.mit.edu!nntp.TheWorld.com!not-for-mail From: Robert A Duff Newsgroups: comp.lang.ada Subject: Re: Pascal Calling Convention Date: Wed, 30 Mar 2011 08:40:46 -0400 Organization: The World Public Access UNIX, Brookline, MA Message-ID: References: <9b04626e-567d-408c-aab3-39b964b3ffd6@l2g2000prg.googlegroups.com> NNTP-Posting-Host: shell01.theworld.com Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii X-Trace: pcls6.std.com 1301488847 20044 192.74.137.71 (30 Mar 2011 12:40:47 GMT) X-Complaints-To: abuse@TheWorld.com NNTP-Posting-Date: Wed, 30 Mar 2011 12:40:47 +0000 (UTC) User-Agent: Gnus/5.1008 (Gnus v5.10.8) Emacs/21.3 (irix) Cancel-Lock: sha1:b75fXsH/sRozKwUFHpqDZsAQmJs= Xref: g2news2.google.com comp.lang.ada:19568 Date: 2011-03-30T08:40:46-04:00 List-Id: "Randy Brukardt" writes: > 99% of the time, executing data is a bug. Why allow it by default? Ah, I didn't realize you were mainly focused on that issue. I agree 100% that executing data is usually a bug, and should be prevented by default. But you don't need segments for that. Paging hardware can do it. (Well, you don't need segments in hardware. The O.S. concocts something like "segments" based on paging. And protects code.) >> Not at all. The statement "All Ada implementations must use a stack >> to implement procedure calls, because the semantics are FIFO." >> is talking about implementations, but it's not target-specific. > > I think it is also close to junk. The semantics are FIFO is fine, but > anything about the underlying data structure is bogus. Unless you are > equating FIFO with stack in all cases, which I don't agree with. A stack is > FIFO, but I don't think that implies that all data structures that are FIFO > are stacks. Of course we both mean "LIFO", not "FIFO" above. > Anyway, this is a pointless discussion. Let's go back to discussing whether > membership is a set operation. ;-) OK, fair enough. ;-) I'd still like to hear Keith's take on all this, if he's still listening. - Bob