02-12-2010, 10:40 PM
I cheated quite a bit with the binary functions (using fastcall as a 16 bit). I think I may have a handle on how stdCall works, but it would be nice to know what is on the stack when a call to a function happens.
There's quite a lot on the stack, and it seems to be replicated with the registers (that is, for something like LONG,LONG - DEHL has the first one, and the stack has both.) There's also some number on the stack ahead of the return address and I can't work out what it's for.
As for Xor - I'm not sure what to shortcut for that. Obviously bXor is the way to go in text. We could totally confuse people and use % so they think it's MOD There aren't many left that wouldn't be confusing. ! is factorial, ? is usually used as a ternary if/then/else (or even a synonym for print, which I never understood). You've used @ as a pointer for the memory address, and # is tied up with the preprocessor - unless it can do double duty.
~ ?
How good is the compiler at not including runtimes it doesn't need at the moment?
There's quite a lot on the stack, and it seems to be replicated with the registers (that is, for something like LONG,LONG - DEHL has the first one, and the stack has both.) There's also some number on the stack ahead of the return address and I can't work out what it's for.
As for Xor - I'm not sure what to shortcut for that. Obviously bXor is the way to go in text. We could totally confuse people and use % so they think it's MOD There aren't many left that wouldn't be confusing. ! is factorial, ? is usually used as a ternary if/then/else (or even a synonym for print, which I never understood). You've used @ as a pointer for the memory address, and # is tied up with the preprocessor - unless it can do double duty.
~ ?
How good is the compiler at not including runtimes it doesn't need at the moment?