|[5 earlier articles]|
|Re: Templates in C++ davidm@flora.Rational.com (1995-05-16)|
|Re: Templates in C++ email@example.com (Greg Morrisett) (1995-05-17)|
|Re: Templates in C++ firstname.lastname@example.org (1995-05-17)|
|Re: Templates in C++ email@example.com (1995-05-25)|
|Re: Templates in C++ firstname.lastname@example.org (1995-05-29)|
|Re: Templates in C++ email@example.com (1995-06-23)|
|Re: Templates in C++ firstname.lastname@example.org (1995-06-25)|
|Re: Templates in C++ email@example.com (1995-06-30)|
|Re: Templates in C++ firstname.lastname@example.org (1995-07-12)|
|From:||email@example.com (Shankar Unni)|
|Organization:||Silicon Graphics, Inc.|
|Date:||Sun, 25 Jun 1995 01:10:29 GMT|
Alex Colvin (firstname.lastname@example.org) wrote:
> Is the main reason for this the need for structure sizes at
> Would link-time be sufficient? Could structure and stack
> frame sizes be computed at link time as the sum of constants generated
> by separate compilations?
Yes, and Yes.
> Are their many linkers capable of performing such arithmetic? Could
> they be used to relax language restrictions?
Not without help.
The SGI Delta/C++ compiler, for instance (plug, plug!) has such a feature:
for classes designated as "dynamic" (in the class spec), the code that is
generated leaves all offsets as zero, with special relocations against the
instructions to be filled in by the linker (or even by the runtime loader).
In fact, this allows library vendors, for instance, to ship new shared
libraries with "compatible" changes (there's a limit to what sort of
changes the compiler can allow without requiring recompilation, of
course), and have the user programs linked against them to continue
running without recompilation.
Shankar Unni E-Mail: email@example.com
Silicon Graphics Inc. Phone: +1-415-390-2072
Return to the
Search the comp.compilers archives again.