Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!sdd.hp.com!spool.mu.edu!munnari.oz.au!bruce!labtam!eyrie!asgard!bart From: bart@asgard.pub.uu.oz.au (John Butcher) Newsgroups: comp.sys.amiga.programmer Subject: Re: Short Hello World Message-ID: <19216341.ARN0401@asgard.pub.uu.oz.au> Date: 12 May 91 19:14:57 GMT Article-I.D.: asgard.19216341.ARN0401 References: <1804@tardis.Tymnet.COM> <1991May7.001146.1830@cinnet.com> Organization: Private Lines: 19 In article , Matthew Dillon writes: > sub.l D0,D0 is not faster than moveq.l #0,D0 on a 68000. The two > instructions are both one word long. What you say is right, but the reasons behind it are worng. Instruction length != instruction timing : sub.l d0,d0 == 6 ( or is it 8 ?? ) moveq.l #0,d0 == 4 > Matthew Dillon dillon@Overload.Berkeley.CA.US > 891 Regal Rd. uunet.uu.net!overload!dillon > Berkeley, Ca. 94708 > USA ----------------------------------------------------------------------------- John Butcher : bart@asgard.pub.uu.oz.au ..!munnari!eyrie.oz.au!asgard!bart "To understand recursion you must understand recursion" - Andrew Koenig