On 30 May 2005, at 19:53, Jamie McCracken wrote:
At the point the inlining is performed, the compiler does not
have the slightest idea how large the function will be in terms
of bytes. There is already a an extremely crude "complexity
calculation" function, but it does not have any relation to size
(only to speed -- to a certain extent).
It doesn't have to be bytes - Would you now how many opcodes are in
the function at that point?
No. The inlining happens at the parse tree level. All we know is the
number and type of nodes (at that point, it could still be reduced/
optimized later).
Jonas
_______________________________________________
fpc-devel maillist - fpc-devel@lists.freepascal.org
http://lists.freepascal.org/mailman/listinfo/fpc-devel
