Message board for the users of flat assembler.
> Compiler Internals > FASM optimizes code?
First of all I wanna say that FASM is the greatest assembler i have ever seen.
Are there any optimization algorithms within?
Sometimes it seems that fasm is iterating my loops to see if they are making sens? In this case you can allways see a status bar. Which you could normally not see if the program is very small. So what is fasm doing?
If I only some iterations in a loop FASM assembles fast.
If I have a greate amount of iterations (maybe a 1000000 times) it assembles very slow.
Another case was a dll. I used the smallest implementation of the essential DllEntry function. Looks like...
This dll does not work because the DllEntry was not to find in the binary file.
But when I implemented some more instructions to the DllEntry...
...then everything is fine.
So what on earth is going on there?
And if there are any optimization, how can I disable them?
|26 Jan 2012, 22:20||
Other than instruction encoding size optimization, there are no optimizations. I'm not so sure what do you mean about the iterations, could you exemplify with code so we can see when fasm takes little time and the code which takes long to compile?
Finally, in the case of the DLL, you should use "ret 12", and the reason reason for the first one to not work may be due to this (follow the links for explanation and use Tomasz's code rather than mine). You don't have this problem with your longest code because there are many references that must be relocated and hence the relocs are not empty.
|27 Jan 2012, 00:10||
< Last Thread | Next Thread >
Copyright © 1999-2020, Tomasz Grysztar. Also on GitHub, YouTube, Twitter.
Website powered by rwasa.