Hans-Peter Diettrich schrieb:
I think that it's time to put aside old experience, and replace it by
up-to-date performance considerations. And since FPC seems to be
optimized and tested very well, even if it doesn't look so at the first
glance, I better concentrate on other tasks.
One of
Op 2010-07-15 23:50, Daniël Mantione het geskryf:
No. That is doesn't do justice to all the effort that is put into
performance optimization. It's not about maintainability being more
important.
It is about making the right trade-offs between:
- Compiler speed
- Compiler memory usage
-
Hello all,
I want to implement kind of executable protection using software
guards (*) - when function (caller) decrypts another function (callee)
before calling it and encrypts it again after callee returns.
As a result I need to get addresses of my functions (where the asm code
starts and
On 07/15/2010 05:17 PM, Adem wrote:
I was curious about the differences about FastMM (which I use under
Delphi) and TopMM, and asked about it in Delphi ThirdPartyTools NG.
Thus TopMM seems excellently suited here.
I don't understand why in their Graphics, they imply that the Delphi 7
On 07/15/2010 04:43 PM, Hans-Peter Diettrich wrote:
Just an idea: When the lists contain many entries, they could be split
into buckets. Then the currently searched bucket(s) could be locked
against use by other threads, which can skip them and inspect the next
bucket.
I suppose their idea
Hi
I just check out and can no longer build the compiler.
This is the used command :
PATH=E:\FPC\2.4.0\bin\i386-win32;%PATH%
make all PP=E:\FPC\2.4.0\bin\i386-win32\ppc386.exe make_all_prefix_res.txt
and the (the last lines of) output
make -C win32 all
make[7]: Entering directory
Daniël Mantione wrote:
Compiler speed can loose from maintainability, but it can also loose
from code quality; the performance of your application is probably also
worth a lot to you.
Does FPC compile significantly faster when using -O- then?
Micha
Op Fri, 16 Jul 2010, schreef Micha Nelissen:
Daniël Mantione wrote:
Compiler speed can loose from maintainability, but it can also loose from
code quality; the performance of your application is probably also worth a
lot to you.
Does FPC compile significantly faster when using -O- then?
Daniël Mantione wrote:
Op Fri, 16 Jul 2010, schreef Micha Nelissen:
Does FPC compile significantly faster when using -O- then?
That is irrelevant; for example the register allocator made the compiler
slower (initially even 3 times, but we managed to reduce it to a few ten
%), but had great
Op Fri, 16 Jul 2010, schreef Micha Nelissen:
Daniël Mantione wrote:
Op Fri, 16 Jul 2010, schreef Micha Nelissen:
Does FPC compile significantly faster when using -O- then?
That is irrelevant; for example the register allocator made the compiler
slower (initially even 3 times, but we
Inoussa OUEDRAOGO wrote on Fri, 16 Jul 2010:
I just check out and can no longer build the compiler.
While it's probably due to a commit of mine, I can't debug it because
everything works fine on Mac OS X and Linux.
Jonas
2010/7/16 Jonas Maebe jonas.ma...@elis.ugent.be:
Inoussa OUEDRAOGO wrote on Fri, 16 Jul 2010:
I just check out and can no longer build the compiler.
While it's probably due to a commit of mine, I can't debug it because
everything works fine on Mac OS X and Linux.
How can I help ?
--
Le 16 juillet 2010 15:33:50 UTC, Inoussa OUEDRAOGO
inouss...@gmail.com a écrit :
2010/7/16 Jonas Maebe jonas.ma...@elis.ugent.be:
Inoussa OUEDRAOGO wrote on Fri, 16 Jul 2010:
I just check out and can no longer build the compiler.
While it's probably due to a commit of mine, I can't debug
On Wed, Jul 14, 2010 at 6:35 PM, Stefan Kisdaroczi ki...@hispeed.ch wrote:
I'm still using it. Or make a symlink:
ln -s rar/zip.pas rar.pas
In combination with {$L xzy.o} and 'external name ...' you can do
wonderful things. Don't do this at home! (maybe at work :-)
Okay... this is very
I did some rough + emprical (i.e. non-exhaustive + non-authoritative)
tests with the native memory managers of
-- x64 FPC (v2.4.3)/Lazarus (v0.9.29-26670),
-- Delphi (2010),
-- FastMM4 v4.94
-- TopMemory v3.54.
Test application is fairly simple: Using a double-linked list, it
generated
Since some time I'm trying to separate the syntax from the semantics
processing in the parser. It turned out to be quite complicated, so that
I want to use some methodology. (Yes, I've been warned ;-)
For profiling and debugging I want to have both the old and new code in
the same executable
16 matches
Mail list logo
