Sujet : Re: Baby X is bor nagain
De : already5chosen (at) *nospam* yahoo.com (Michael S)
Groupes : comp.lang.cDate : 13. Jun 2024, 17:13:51
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <20240613191351.00000365@yahoo.com>
References : 1 2 3 4 5 6 7 8 9 10
User-Agent : Claws Mail 3.19.1 (GTK+ 2.24.33; x86_64-w64-mingw32)
On Thu, 13 Jun 2024 14:46:32 +0100
bart <
bc@freeuk.com> wrote:
Within my compiler, each single number takes a 64-byte record to
represent. So 1MB of data takes 64MB, while a 1MB string takes one
64-byte record plus the 1MB of the string data.
Then there are the various type analysis and other passes that have
to be done a million times rather then once. I'd imagine that
compilers like gcc do a lot more.
For gcc up to certain limit I measured ~160 bytes per number.
After that certain very big limit (probably 64M numbers) gcc appears
to switch into more economical mode - ~112 bytes per number. At ~300M
numbers it appears to become yet more economical, but still above 100
bytes per number. 400M number - 100 bytes per number. Going further
became quite time consuming so I gave up.