Return to the
comp.compilers page.
Search the
comp.compilers archives again.
| Related articles |
|---|
| Re: Strength reduction of constant multipliers davidm@voltaire.rational.com (1992-10-14) |
| Re: Strength reduction of constant multipliers preston@dawn.cs.rice.edu (1992-10-20) |
| Constant divisions, remainders rutt@paradise.mti.sgi.com (1992-10-20) |
| Re: Constant divisions, remainders Cheryl_Lins@gateway.qm.apple.com (Cheryl Lins) (1992-10-21) |
| Re: Constant divisions, remainders phillips@swanee.ee.uwa.oz.au (1992-10-23) |
| Re: Constant divisions, remainders kelsey@flora.ccs.northeastern.edu (1992-10-27) |
| Re: Constant divisions, remainders torbenm@diku.dk (1992-11-02) |
| Re: Constant divisions, remainders joe@babel.ho.att.com (1992-11-05) |
| Re: Constant divisions, remainders henry@zoo.toronto.edu (1992-11-08) |
| [7 later articles] |
| Newsgroups: | comp.compilers |
| From: | rutt@paradise.mti.sgi.com |
| Organization: | Silicon Graphics, Inc. Mountain View, CA |
| Date: | Tue, 20 Oct 1992 14:24:36 GMT |
| Keywords: | arithmetic, optimize |
| References: | 92-10-074 92-10-069 |
(Responding to Preston's post regarding reduction in strength of constant
multiplications.)
I saw you post regarding constant multiplications on comp.compilers. I
was curious as to whether you have any ideas about divisons and remainders
by constants. Of course the powers of 2 are easy, but what about the more
interesting cases. There seems to be some confusion around here as to
whether there is any hope for these.
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.