Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Posting-Version: version B 2.10.2 (Tek) 9/28/84 based on 9/17/84; site tekig4.UUCP Path: utzoo!linus!decvax!tektronix!tekig5!tekig4!rosalia From: rosalia@tekig4.UUCP (Mark Galassi) Newsgroups: net.arch,net.lang.c,net.micro,net.micro.pc,net.micro.68k Subject: Re: Re: Re: Need 286 "C" benchmark Message-ID: <107@tekig4.UUCP> Date: Thu, 30-May-85 13:29:25 EDT Article-I.D.: tekig4.107 Posted: Thu May 30 13:29:25 1985 Date-Received: Mon, 12-Aug-85 06:07:24 EDT References: <426@oakhill.UUCP> <8745@microsoft.UUCP> <583@intelca.UUCP> <433@oakhill.UUCP> <588@intelca.UUCP> <146@tekcrl.UUCP> Reply-To: rosalia@tekig4alassi.UUCP (Mark Galassi) Organization: Tektronix, Beaverton OR Lines: 31 In article <146@tekcrl.UUCP> terryl@tekcrl.UUCP () writes: >>> int a[50000]; >>> >>> main() >>> { >>> int i; >>> for (i=0; i<50000; i++) a[i+1] = a[i]; >>> } >>> >>> Dave Trissel {seismo,ihnp4}!ut-sally!oakhill!davet >>> Motorola Semiconductor Inc. Austin, Texas >>> "I work with 'em and mine works" > > OK, here are times for a 68010 system we use here at Tek running 4.2, >with ONE wait state for the memory subsystem. This was on an unloaded system. >Do whatever you want with the times. The compiler was the Greenhills compiler >for the 68000. > >1.2u 0.1s 0:01 99% 0+16k 0+0io 1pf+0w >1.2u 0.1s 0:01 98% 0+16k 0+1io 1pf+0w > > Terry Laskodi > of > Tektronix We might do things correctly (and show ADA fans that C programs can respect array boundaries) and use for (i=0; i<49999; i++) a[i+1] = a[i]; ^^^^^ Mark Galassi tektronix!tekig4!rosalia