On Thu, 18 Nov 2004, Arkady V.Belousov wrote:
Of course, qsort() if very fast algo (except some specific cases, when
it is O(N^2)), but why to do _any_ extra action, when unnecessary? :)
Especially, I suggest, (most) linkers do own sorting anyway?
I think even bubble sort would be fast
Hi!
20--2004 18:54 [EMAIL PROTECTED] (Bart Oldeman) wrote to
[EMAIL PROTECTED]:
Hm. I think for simplicity and safety, exeflat should itself move
relocation table from executable's header inside executable itself, so that
it may be reused by MoveKernel(). This allows to eliminate manual
On Sat, 20 Nov 2004, Arkady V.Belousov wrote:
Yes, and then now may be reduced code duplication in asmsupt.asm (which
generated both for transient and resident portion).
only for Borland C. For Watcom they are not duplicated (only one CS:
there). And anyway it's only a small amount of
