Sourcecoder produces some incorrect optimizations right now, but there is a demo version of the optimizer a couple pages back, have you tried that one?
EDIT: BLARG my optimizer ran amuk and deleted half my source And i didnt notice and went to compile and it backed up the corupted version :'(
Yeah, rules are fuzzy when it comes to things like that Thats why they can actually take your personal property without your consent and stuff like that.
I like the way you think Deep Thought IMHO if we are going to be doing such complicated things that we are coding in half asm and half axe at the same time, maybe it would just be easier to code in straight asm or add in some small hex codes for small things
Garrg, so there are a lot of sneaky things happening now So InData stops as soon as it finds a 0, since thats the definition of the end. BUT what about 2 byte tokens? for example Str1 has a 0 as its second byte, so the optimizar treats that as the end of the program. So now before it parses the program it goes through and changes all the 0's into 60, which is unused in all two byte tokens. Then when the program is finished, it goes back and changes all the 60's back into 0's. lol
EDIT: Grrr but that means that it would mess up hacked variables. Hmmm i will have to think about this some more...
EDIT2: Yay got it to work, if it quits and it finds that its not at the end of the file, it scratches its head and turns around and goes back into the search loop ^^
Unfortunately no form of percentage can be calculated but i think it will be fast enough Currently i have no real working code however so i cant give anything out I did document all the optimizations i currently am implementing and they are up to 12
As for the (A-B)*5->C, it currently isn't smart enough to do things like that, and i imagine getting it to the point where it can recognize expressions like that would be crazy hard to do, but if i figure out a way to do it, hells yeah i will
Hmm i just have to remember that using this method ignores strings, so that when i find a token to optimize, i will have to search backwards in the file to determine if its inside a string or not. This also makes the loading bar a lot harder to implement since all the time spent searching will be spent in a single command. Hmmmm i shall see how fast everything is
So i had a great idea! Why not use InData() to search for trigger tokens in the program to be optimized? I tested an 8000 bytes file and it could search through the entire file in less than a second! This means possibility for lightning fast optimization!
Hmmm how would register access work well though? Since there are so many restrictions on what you can add and what you can store to. Like you cant add register b and c with one command. I guess it would be an especially asmers only command?
Show Posts
Looks great!
And i didnt notice and went to compile and it backed up the corupted version :'(
Thats why they can actually take your personal property without your consent and stuff like that.
IMHO if we are going to be doing such complicated things that we are coding in half asm and half axe at the same time, maybe it would just be easier to code in straight asm or add in some small hex codes for small things
if i remember correctly there is an easter egg in windows where you can get to that, and it was a lot harder.
So InData stops as soon as it finds a 0, since thats the definition of the end. BUT what about 2 byte tokens? for example Str1 has a 0 as its second byte, so the optimizar treats that as the end of the program. So now before it parses the program it goes through and changes all the 0's into 60, which is unused in all two byte tokens. Then when the program is finished, it goes back and changes all the 60's back into 0's. lol
but i think it will be fast enough 
Currently i have no real working code however so i cant give anything out 
if it takes more than a few seconds ill just have a loading message, or a small animation
and awesome on the optimization!