Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10 5/3/83; site umcp-cs.UUCP
Path: utzoo!linus!decvax!harpo!seismo!rlgvax!cvl!umcp-cs!chris
From: chris@umcp-cs.UUCP
Newsgroups: net.lang.c
Subject: Re: CMU technical report on C language efficiency
Message-ID: <3370@umcp-cs.UUCP>
Date: Wed, 26-Oct-83 19:40:12 EDT
Article-I.D.: umcp-cs.3370
Posted: Wed Oct 26 19:40:12 1983
Date-Received: Fri, 28-Oct-83 01:37:30 EDT
References: <1765@ihnss.UUCP>
Organization: Univ. of Maryland, Computer Science Dept.
Lines: 21

An interesting thing they found was that

	i--;

ran slower than

	i -= 1;

They thought that was strange, so they looked at the assembly output.
It was the same for both statements.  The reason i -= 1 ran faster was
that it was on a longword boundary.

Just goes to show that when you're looking too hard for efficency,
you're probably going to find the wrong thing.  Or, as Jon Bentley of
Bell Labs says, "People who deal with bits should expect to get bitten."

(Sorry if I misspelled your name there.)
-- 
In-Real-Life: Chris Torek, Univ of MD Comp Sci
UUCP:	{seismo,allegra,brl-bmd}!umcp-cs!chris
CSNet:	chris@umcp-cs		ARPA:	chris.umcp-cs@CSNet-Relay