From: | john.gilliver@gecm.com (John Gilliver) |
Newsgroups: | comp.arch,comp.compilers,comp.dsp |
Date: | 20 Mar 1996 23:27:38 -0500 |
Organization: | GEC-Marconi Research Centre |
References: | 96-03-006 96-03-091 96-03-111 |
Keywords: | optimize, architecture, DSP |
Mike Albaugh (albaugh@agames.com) wrote:
[]
: No language is a perfect match for all algorithms. C, in
: particular, "dislikes" fixed-point math, multi-precision, co-routines,
: and a few other features of some nice algorithms that pop up a lot in
: embedded code. Before I get flamed to death by "you can do anything in
Another thing that C is not too familiar with (this is more relevant
to the DSP newsgroup than the other two I see this is going to, though
still relevant) is processors which have different hardware spaces for
programme and data, and sometimes two memory spaces for data as well
making three in all. This latter implementation makes certain
operations - processing of (arrays of) complex numbers, for example -
much easier on certain processors. I believe the "numerical extensions
to C" group have gone some way to handling this matter (implementing
"complex" numbers [in all their forms] for example), but I have not
had experience of it. With some compilers (I won't mention the name of
the one we have used) it is not _possible_ to have data in both X and
Y memory (this is 96002-speak) without inline code.
--
J. P. Gilliver | Tel: +44 1245 242133
GEC-Marconi Research Centre | Fax: +44 1245 475244 or 478639
GEC-Marconi Ltd, GREAT | Home: G6JPG@soft255.demon.co.uk
BADDOW, Essex, CM2 8HN, UK. | Email: john.gilliver@gecm.com
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.