Re: Function order of execution

From: Kurt Barthelmess (kbarthelmess_at_compuserve.com)
Date: 11/21/03 

Date: Fri, 21 Nov 2003 21:40:38 GMT

"Sven Pran" <no.direct@mail.please> wrote:

>I seriously suspect that this implication was never intended by the writer
>of the calling conventions when he used the word "evaluate".

I agree. Nor did (s)he understand the implications. This may be a WAD,
a boo-boo on the part of the author, or a Delphi bug.

>It just makes no sense to prepare the EAX register with reference to
>(or value of) the first parameter while still probably being needed to
>prepare other parameters in the list.

Even worse, one can not simply "push" the first parameter onto the
stack to hold it and then pop it back into EAX. By that time you could
have umpty-ump things on the stack (parameters 4, 5, 6...) Still, it
wouldn't be that inefficient to push it onto the stack, load it from
the stack make the call and then pop the 1-3 entries. That's no worse
than the stuff that happens when you do something like:
  P(String1 + String2);

Kurt

Relevant Pages

  • Re: Is it wise to push all-in early in a tournament?
    ... The best times to make a push play ... But why call when you can push and take down a nice pot when your opponent ... But remember that if this "big bet" is a significant portion of your stack, ... I consider it my goal in any tournament to do the latter as much as ...
    (rec.gambling.poker)
  • Re: Is it wise to push all-in early in a tournament?
    ... whether or not the rest of the table is splashing chips around. ... I may push more than I want to and you may be more conservative than ... Do I want to play this opponent after the flop? ... push at anytime and I may not want to risk my stack on a suckout when I ...
    (rec.gambling.poker)
  • Virtual machine: assembly instructions
    ... push; Push the address of the first variable onto the stack ... itof: convert integer to float ... If top+1 of int stack is less than top; push true else push false ...
    (comp.programming)
  • Re: Building Unification Table - tranforming prolog like notation into lisp notation
    ... |> problem comes from tranlating prolog notation into lisp notation. ... ;; Here is a quickly done stack based solution for the problem Slobodan ... (defstruct composite-term str indices) ... (push (cons (composite-term-str item) ...
    (comp.lang.lisp)
  • Re: Free word order
    ... > Frontwardness of language: Going S O V. ... I agree that SVO is a bit mixed-up for me as a native speaker of a SOV ... In a SOV language by analogy, the arguments are pushed to the stack ... no idea so push it ...
    (sci.lang)