21 Sep
2010
21 Sep
'10
8:19 p.m.
On Sep 21, 2010, at 1:02 PM, Oliver Hunt wrote:
On Sep 21, 2010, at 12:57 PM, Maciej Stachowiak wrote:
On Sep 21, 2010, at 11:37 AM, Holger Freyther wrote:
I wonder (and will try to measure based on sunspider and other test content) how many functions occur like function f(x) { return x +2; } or even fully constant. Is there any classification of the complexity of functions at parse time?
I wonder how ES5 strict mode affects the challenge of doing inlining correctly.
In strict mode arguments aren't live, arguments.callee, function.caller and function.arguments throw for any strict function.
That should make it practical to inline a wider range of functions if they are declared strict. Regards, Maciej