Re: Optimizing Static Variable Layout

randyhyde@xxxxxxxxxxxxx écrivait news:1114616914.963184.323790
@z14g2000cwz.googlegroups.com:

>
> randyh...@xxxxxxxxxxxxx wrote:
>>
>> As for the first issue f0dder raises, the complexity of the
> algorithm,
>> what RosAsm is doing is *not* what RosAsm is doing. RosAsm simply
>> injects extra bytes between each declaration block
>
> Sorry, I blew this sentence. It should read "what I'm suggesting is not
> what RosAsm is doing."

Second read: Ah! Yes! You are right: You were _really_
talking of re-aranging the Variables in Memory, depending
on their sizes!!!...

Excuse me. This is so stupid, that i had to go to a wrong
interpretation...

:)


Betov.

< http://rosasm.org/ >



.

Relevant Pages

  • Re: Optimizing Static Variable Layout
    ... >> As for the first issue f0dder raises, the complexity of the ... >> injects extra bytes between each declaration block ...
    (alt.lang.asm)
  • Re: FUD about CGD and GBDE
    ... >government has approved the use of AES with 256 bit keys for very ... that stress on the algorithm and maintain 256 bits of margin. ... I don't seriously think that either of CGD or GBDE will be broken ... The first reason is that it adds complexity. ...
    (freebsd-hackers)
  • Re: Hooray: the Church of Scotland shows the way
    ... If you are simply pointing out the limitations of algorithmic machines then I agree completely. ... any Turing machine could print out the solution to a non-computable problem if that solution were part of the machine's algorithm. ... Given the complexity of the universe it doesn't seem unlikely that the solutions to all manner of non-computable problems have been physically realised in some form and lie there waiting for us to latch on to them somehow. ... Whilst it's true that fundamental physics are essentially algorithmic in nature, ...
    (uk.religion.christian)
  • Re: Predicting the Future and Kolmogorov Complexity
    ... complexity" as defined and modified by those like Kolmogorov, Chaitin, ... The algorithm used to compute pi doesn't ... cannot be algorithmically random. ...
    (talk.origins)
  • Re: Intro to Programming w/ Machine Language
    ... > Based upon your previous posts, I found this pretty surprising. ... > If n is sufficiently large, the Ocomplexity obviously matters. ... where's the Oor Oalgorithm that's ... people use in the good old "assembly vs. HLL" religous wars. ...
    (alt.lang.asm)