Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!know!samsung!zaphod.mps.ohio-state.edu!van-bc!ubc-cs!fs1!ee.ubc.ca!mikeb
From: mikeb@salmon.ee.ubc.ca (Mike Bolotski)
Newsgroups: comp.lang.misc
Subject: Re: Compiler Costs
Message-ID: <1319@fs1.ee.ubc.ca>
Date: 11 Jul 90 05:16:23 GMT
References: <1797@apctrc.UUCP> <2317@l.cc.purdue.edu> <2681@awdprime.UUCP>
Sender: root@fs1.ee.ubc.ca
Reply-To: mikeb@salmon.ee.ubc.ca
Organization: Dept of EE, University of British Columbia
Lines: 14


In article <2681@awdprime.UUCP>, tif@doorstop.austin.ibm.com (Paul
Chamberlain) writes:
> 
> P.S.	Another good example is parity.  Takes about 25 instructions
> 	in C, about 1 in assembly (using intel anyway).

Deja voodoo. Lookup table.  3-4 instructions. Maybe less, depending on
addressing modes available. 

---
Mike Bolotski, Department of Electrical Engineering,
               University of British Columbia, Vancouver, Canada 
mikeb@salmon.ee.ubc.ca             | mikeb%salmon.ee.ubc.ca@relay.ubc.ca