Path: utzoo!attcan!uunet!lll-winken!lll-lcc!ames!pasteur!ucbvax!decwrl!purdue!i.cc.purdue.edu!j.cc.purdue.edu!pur-ee!a.cs.uiuc.edu!m.cs.uiuc.edu!grunwald From: grunwald@m.cs.uiuc.edu Newsgroups: comp.arch Subject: Re: RISC bashing at USENIX Message-ID: <3300031@m.cs.uiuc.edu> Date: 15 Jul 88 16:10:00 GMT References: <6888@ico.ISC.COM> Lines: 6 Nf-ID: #R:ico.ISC.COM:6888:m.cs.uiuc.edu:3300031:000:278 Nf-From: m.cs.uiuc.edu!grunwald Jul 15 11:10:00 1988 Actually, I would be agast if bcopy() didn't use an unrolled version of the loop; by jumping into a table of MOV instructions, you can eliminate the decrement and jump instructions, giving a much higher data movement for less instructions. But this has been hashed out before.