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: 103376,99a6311c4195e21b X-Google-Attributes: gid103376,public From: "Howard W. LUDWIG" Subject: Re: Matrix Multiplication Date: 1999/12/16 Message-ID: <38591989.C4A56F40@lmco.com>#1/1 X-Deja-AN: 561588070 Content-Transfer-Encoding: 7bit References: <9BBB0C9AF506D311A68E00902745A537C41148@fsxqpz04.usafa.af.mil> X-Accept-Language: en,pdf Content-Type: text/plain; charset=us-ascii Organization: LMC Mime-Version: 1.0 Newsgroups: comp.lang.ada Date: 1999-12-16T00:00:00+00:00 List-Id: Well, I've worked on a processor which has a rather complex instruction set, although it did not include matrix multiplication as an instruction. My favorite instruction was the one that allowed me to do FFTs on a power-of-2, up to 64, number of complex data items. The Ada compiler vendor had lots of fun with this machine--they created a package of Machine-Specific Procedures which we could call and would be compiled/translated into the corresponding assembly instruction inline. About 90 % of the code looked like assembly language with Ada syntax (semicolon at the end of the statement, parentheses around the set of operands, ...). Now you might ask why we did such a thing--why not just write in assembly language in the first place? Let's just say--overzealous bureaucrats enforcing the "single language policy" (also commonly known as "the Ada Mandate"). Howard W. LUDWIG "Carlisle, Martin" wrote: > > Suppose you have such a machine (wow! talk about complex instruction sets!). > I then grant that any good Fortran compiler would use it. However, it also > follows that any Ada compiler could create a small function to use it (e.g. > using Machine code insertions), and then pragma Inline that function. > > --Martin