Related articles |
---|
[4 earlier articles] |
Re: HLL syntax & structure suited to rapid compilation? ceco@jupiter.com (Tzvetan Mikov) (2002-08-10) |
Re: HLL syntax & structure suited to rapid compilation? marcov@toad.stack.nl (Marco van de Voort) (2002-08-10) |
Re: HLL syntax & structure suited to rapid compilation? marcov@toad.stack.nl (Marco van de Voort) (2002-08-14) |
Re: HLL syntax & structure suited to rapid compilation? joachim_d@gmx.de (Joachim Durchholz) (2002-08-23) |
Re: HLL syntax & structure suited to rapid compilation? ceco@jupiter.com (Tzvetan Mikov) (2002-08-23) |
Re: HLL syntax & structure suited to rapid compilation? marcov@toad.stack.nl (Marco van de Voort) (2002-08-24) |
Re: HLL syntax & structure suited to rapid compilation? marcov@toad.stack.nl (Marco van de Voort) (2002-08-24) |
From: | "Marco van de Voort" <marcov@toad.stack.nl> |
Newsgroups: | comp.compilers |
Date: | 24 Aug 2002 11:59:06 -0400 |
Organization: | Eindhoven University of Technology, The Netherlands |
References: | 02-07-098 02-07-121 02-07-128 02-08-005 02-08-024 02-08-054 02-08-065 |
Keywords: | performance, design |
Posted-Date: | 24 Aug 2002 11:59:05 EDT |
Tzvetan Mikov wrote:
> "Marco van de Voort" <marcov@toad.stack.nl> wrote in message
>> Tzvetan Mikov wrote:
>>> [... that Borland C/Delphi optimizer is not very good]
>>
>> But how did the overal performance differ?
>>[...]
>
> I have made some CPU-intensive comparisons between Windows compilers
> and in each case Borland C invariably came out at least 20% slower
> than Visual C or GCC. This is a very substancial difference in the
> context of comp.compilers, I think.
IMHO I'd say that that depends if that CPU-intensive is some numerical
benchmark or not. Most of the "benchmarks" are non relevant for real
world performance.
> In the context of real-world Windows programming and the typical
> applications that are developed with Delphi (GUI and database
> frontends?) such performance difference couldn't matter less... :-)
There still are gradations in performance between being the best in
numerical benchmarks and performance being irrelevant due to external
:-)
If a compiler is somewhat optimizing for normal algo's, other things
get more important;
Things like
- language helpers (strings, dynamic arrays, exceptions)
- Is the basic architecture of the types that need
special treatment optimized
- Will simple or medium operations get inlined?
- Do the calls to helpers only use the minimal amount of registers,
and does the optimizer keep data in regs then?
- Does the compiler avoid generating helper calls if they are
strictly not necessary?
- inlining of small procs and/or switch to reg params for small procs.
(and optimizing over it)
- Improving of operations on the native stringtype
are IMHO much more important than the degree of tail recursion etc.
Return to the
comp.compilers page.
Search the
comp.compilers archives again.