Article View: comp.lang.misc
Article #1339Re: Compiler Costs
From: Peter da Silva
Date: Mon, 16 Jul 1990 11:26
Date: Mon, 16 Jul 1990 11:26
15 lines
1102 bytes
1102 bytes
In article <56704@lanl.gov> jlg@lanl.gov (Jim Giles) writes: [lookup table] > Works just fine (but still slower than the assemble - by a lot) - provided > that you are doing parity checking of something _small_, like a single > byte. The table gets kind of large for a 32-bit integer. Luckily, parity is conserved. Thus you can use the byte lookup table 4 times over the word. If things are getting tight enough and you're working on a hot spot, then break out the assembler (but leave the original code ifdeffed in). Harder to do with checksums, though. -- Peter da Silva. `-_-' +1 713 274 5180. <peter@ficc.ferranti.com>
Technical Details
Message-ID:
<=AP4-:8@ggpc2.ferranti.com>Path:
arc1-ca.pugleaf.net!utzoo!utgpu!watserv1!watmath!att!dptg!ulysses!andante!mit-eddie!media-lab!snorkelwacker!usc!cs.utexas.edu!uunet!ficc!peterReferences:
<1319@fs1.ee.ubc.ca> <56704@lanl.gov>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!utzoo!utgpu!watserv1!watmath!att!dptg!ulysses!andante!mit-eddie!media-lab!snorkelwacker!usc!cs.utexas.edu!uunet!ficc!peter From: peter@ficc.ferranti.com (Peter da Silva) Newsgroups: comp.lang.misc Subject: Re: Compiler Costs Message-ID: <=AP4-:8@ggpc2.ferranti.com> Date: 16 Jul 90 11:26:30 GMT References: <1319@fs1.ee.ubc.ca> <56704@lanl.gov> Reply-To: peter@ficc.ferranti.com (Peter da Silva) Organization: Xenix Support, FICC Lines: 11