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.3 required=5.0 tests=BAYES_00,INVALID_MSGID autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 114669,94472ba0fa186a8d X-Google-Attributes: gid114669,public X-Google-Thread: 1147fc,94472ba0fa186a8d X-Google-Attributes: gid1147fc,public X-Google-Thread: 103376,94472ba0fa186a8d X-Google-Attributes: gid103376,public From: dewar@merv.cs.nyu.edu (Robert Dewar) Subject: Re: ADA on the super Date: 1998/04/21 Message-ID: #1/1 X-Deja-AN: 346289356 Distribution: inet References: <6h7v0c$r68$1@bambi.zdv.Uni-Mainz.DE> <6ha2lu$5cb$1@nnrp1.dejanews.com> <6hfjmg$hvt@top.mitre.org> X-Complaints-To: usenet@news.nyu.edu X-Trace: news.nyu.edu 893163601 13185 (None) 128.122.140.58 Organization: New York University Newsgroups: comp.sys.super,comp.parallel.mpi,comp.lang.ada Date: 1998-04-21T00:00:00+00:00 List-Id: Andi said <> No, the optimization you cite is at a radically different semantic level. There is nothing like dynamic slices and concatenations in C. If you write Ada code that corresponds to the C code you gave, which is easy to do, you will of course get identical code. But there is no C code that is even vaguely like the quoted Ada code. To get a feel for the issues involved, look at the exp_pakd unit in GNAT, and also study some -gnatdg output, to understand the general semantic level of the tree expansions involved here. Remember that we are talking about very general capabilities here, which just happen to be used in this particular case to do a rotate.