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-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,8c8550b9f2cf7d40
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 2003-06-08 23:58:12 PST
Path: 
 archiver1.google.com!news1.google.com!newsfeed.stanford.edu!logbridge.uoregon.edu!arclight.uoregon.edu!wn13feed!wn12feed!worldnet.att.net!204.127.198.203!attbi_feed3!attbi_feed4!attbi.com!sccrnsc01.POSTED!not-for-mail
From: tmoran@acm.org
Newsgroups: comp.lang.ada
Subject: Re: Is ther any sense in *= and matrices?
References: <bebbba07.0306082024.7cebb5df@posting.google.com>
X-Newsreader: Tom's custom newsreader
Message-ID: <6eWEa.73297$d51.141789@sccrnsc01>
NNTP-Posting-Host: 12.234.13.56
X-Complaints-To: abuse@attbi.com
X-Trace: sccrnsc01 1055141890 12.234.13.56 (Mon, 09 Jun 2003 06:58:10 GMT)
NNTP-Posting-Date: Mon, 09 Jun 2003 06:58:10 GMT
Organization: AT&T Broadband
Date: Mon, 09 Jun 2003 06:58:10 GMT
Xref: archiver1.google.com comp.lang.ada:38848
Date: 2003-06-09T06:58:10+00:00
List-Id: <comp.lang.ada>

> > >about 19 seconds, and the "+" version took about 55 seconds. That's
> > took 4.38 and 3.28 seconds, a factor of 1.33, and using Gnat 3.15p
> I'm using gcc 2.95.2 on a Sunblade 2000. I can't post the code,
  Here's my code.  Please try it on the Sunblade 2000 with gcc 2.95.2
and let us know the results.
#include <stdio.h>
#include <time.h>
#define N 3
        // 4.386/3.275= 1.33              10M            N=3

struct matrices{int x[N][N];};

struct matrices f(struct matrices left, struct matrices right){
        struct matrices result;
        int i,j;
        for(i=0;i<N;i++)
                for(j=0;j<N;j++)
                        result.x[i][j]=left.x[i][j]+right.x[i][j];
    return result;
}

void add_to(struct matrices left, struct matrices right){
        int i,j;
        for(i=0;i<N;i++)
                for(j=0;j<N;j++)
                        left.x[i][j]+=right.x[i][j];
}

void set(struct matrices m, int v){
        int i,j;
        for(i=0;i<N;i++)
                for(j=0;j<N;j++)
                        m.x[i][j]=v;
}

void main() {
        int i;
        clock_t t0,t1,t2;
        matrices a;
        matrices b;
        printf("Go ");
        set(a,0);
        set(b,0);
        add_to(a,b);
        a = f(a,b);
        t0 = clock();
        for(i=0;i<10000000;i++)
          add_to(a,b);
        t1 = clock();
        for(i=0;i<10000000;i++)
          a = f(a,b);
        t2=clock();
        printf("%i %i %i",(int)CLOCKS_PER_SEC,(int)(t1-t0),(int)(t2-t1));
}