2011-06-09 11:40:22 +00:00
|
|
|
// Copyright 2011 the V8 project authors. All rights reserved.
|
2008-09-03 07:31:19 +00:00
|
|
|
// Redistribution and use in source and binary forms, with or without
|
|
|
|
// modification, are permitted provided that the following conditions are
|
|
|
|
// met:
|
|
|
|
//
|
|
|
|
// * Redistributions of source code must retain the above copyright
|
|
|
|
// notice, this list of conditions and the following disclaimer.
|
|
|
|
// * Redistributions in binary form must reproduce the above
|
|
|
|
// copyright notice, this list of conditions and the following
|
|
|
|
// disclaimer in the documentation and/or other materials provided
|
|
|
|
// with the distribution.
|
|
|
|
// * Neither the name of Google Inc. nor the names of its
|
|
|
|
// contributors may be used to endorse or promote products derived
|
|
|
|
// from this software without specific prior written permission.
|
|
|
|
//
|
|
|
|
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
|
|
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
|
|
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
|
|
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
|
|
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
|
|
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
|
|
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
|
|
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
|
|
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
|
|
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
|
|
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
|
2010-12-15 18:13:02 +00:00
|
|
|
// Flags: --allow-natives-syntax
|
2008-09-03 07:31:19 +00:00
|
|
|
|
2010-02-09 12:15:34 +00:00
|
|
|
var RUN_WITH_ALL_ARGUMENT_ENTRIES = false;
|
|
|
|
var kOnManyArgumentsRemove = 5;
|
|
|
|
|
2008-09-03 07:31:19 +00:00
|
|
|
function makeArguments() {
|
|
|
|
var result = [ ];
|
|
|
|
result.push(17);
|
|
|
|
result.push(-31);
|
2009-03-05 12:45:47 +00:00
|
|
|
result.push(new Array(100));
|
|
|
|
result.push(new Array(100003));
|
2008-09-03 07:31:19 +00:00
|
|
|
result.push(Number.MIN_VALUE);
|
|
|
|
result.push("whoops");
|
|
|
|
result.push("x");
|
|
|
|
result.push({"x": 1, "y": 2});
|
|
|
|
var slowCaseObj = {"a": 3, "b": 4, "c": 5};
|
|
|
|
delete slowCaseObj.c;
|
|
|
|
result.push(slowCaseObj);
|
|
|
|
result.push(function () { return 8; });
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
var kArgObjects = makeArguments().length;
|
|
|
|
|
|
|
|
function makeFunction(name, argc) {
|
|
|
|
var args = [];
|
|
|
|
for (var i = 0; i < argc; i++)
|
|
|
|
args.push("x" + i);
|
|
|
|
var argsStr = args.join(", ");
|
|
|
|
return new Function(args.join(", "), "return %" + name + "(" + argsStr + ");");
|
|
|
|
}
|
|
|
|
|
2010-03-11 09:27:12 +00:00
|
|
|
function testArgumentCount(name, argc) {
|
2008-09-03 07:31:19 +00:00
|
|
|
for (var i = 0; i < 10; i++) {
|
2010-03-11 09:27:12 +00:00
|
|
|
var func = null;
|
|
|
|
try {
|
|
|
|
func = makeFunction(name, i);
|
|
|
|
} catch (e) {
|
2010-07-07 10:28:22 +00:00
|
|
|
if (e != "SyntaxError: Illegal access") throw e;
|
2010-03-11 09:27:12 +00:00
|
|
|
}
|
|
|
|
if (func === null && i == argc) {
|
|
|
|
throw "unexpected exception";
|
|
|
|
}
|
2008-09-03 07:31:19 +00:00
|
|
|
var args = [ ];
|
|
|
|
for (var j = 0; j < i; j++)
|
|
|
|
args.push(0);
|
|
|
|
try {
|
|
|
|
func.apply(void 0, args);
|
|
|
|
} catch (e) {
|
|
|
|
// we don't care what happens as long as we don't crash
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
function testArgumentTypes(name, argc) {
|
|
|
|
var type = 0;
|
|
|
|
var hasMore = true;
|
|
|
|
var func = makeFunction(name, argc);
|
|
|
|
while (hasMore) {
|
|
|
|
var argPool = makeArguments();
|
2010-02-09 12:15:34 +00:00
|
|
|
// When we have 5 or more arguments we lower the amount of tests cases
|
|
|
|
// by randomly removing kOnManyArgumentsRemove entries
|
|
|
|
var numArguments = RUN_WITH_ALL_ARGUMENT_ENTRIES ?
|
|
|
|
kArgObjects : kArgObjects-kOnManyArgumentsRemove;
|
|
|
|
if (argc >= 5 && !RUN_WITH_ALL_ARGUMENT_ENTRIES) {
|
|
|
|
for (var i = 0; i < kOnManyArgumentsRemove; i++) {
|
|
|
|
var rand = Math.floor(Math.random() * (kArgObjects - i));
|
|
|
|
argPool.splice(rand,1);
|
|
|
|
}
|
|
|
|
}
|
2008-09-03 07:31:19 +00:00
|
|
|
var current = type;
|
|
|
|
var hasMore = false;
|
|
|
|
var argList = [ ];
|
|
|
|
for (var i = 0; i < argc; i++) {
|
2010-02-09 12:15:34 +00:00
|
|
|
var index = current % numArguments;
|
|
|
|
current = (current / numArguments) << 0;
|
|
|
|
if (index != (numArguments - 1))
|
2008-09-03 07:31:19 +00:00
|
|
|
hasMore = true;
|
|
|
|
argList.push(argPool[index]);
|
|
|
|
}
|
|
|
|
try {
|
|
|
|
func.apply(void 0, argList);
|
|
|
|
} catch (e) {
|
|
|
|
// we don't care what happens as long as we don't crash
|
|
|
|
}
|
|
|
|
type++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
var knownProblems = {
|
|
|
|
"Abort": true,
|
2010-01-06 14:40:21 +00:00
|
|
|
|
|
|
|
// Avoid calling the concat operation, because weird lengths
|
2011-02-14 17:25:12 +00:00
|
|
|
// may lead to out-of-memory. Ditto for StringBuilderJoin.
|
2010-01-06 14:40:21 +00:00
|
|
|
"StringBuilderConcat": true,
|
2011-02-14 17:25:12 +00:00
|
|
|
"StringBuilderJoin": true,
|
2010-01-06 14:40:21 +00:00
|
|
|
|
2008-09-03 07:31:19 +00:00
|
|
|
// These functions use pseudo-stack-pointers and are not robust
|
|
|
|
// to unexpected integer values.
|
|
|
|
"DebugEvaluate": true,
|
|
|
|
|
|
|
|
// These functions do nontrivial error checking in recursive calls,
|
|
|
|
// which means that we have to propagate errors back.
|
|
|
|
"SetFunctionBreakPoint": true,
|
|
|
|
"SetScriptBreakPoint": true,
|
|
|
|
"PrepareStep": true,
|
2008-10-31 08:51:26 +00:00
|
|
|
|
2008-11-03 12:07:22 +00:00
|
|
|
// Too slow.
|
|
|
|
"DebugReferencedBy": true,
|
|
|
|
|
2008-10-31 08:51:26 +00:00
|
|
|
// Calling disable/enable access checks may interfere with the
|
|
|
|
// the rest of the tests.
|
|
|
|
"DisableAccessChecks": true,
|
|
|
|
"EnableAccessChecks": true,
|
2010-01-06 14:40:21 +00:00
|
|
|
|
2008-09-03 07:31:19 +00:00
|
|
|
// These functions should not be callable as runtime functions.
|
2011-06-09 11:40:22 +00:00
|
|
|
"NewFunctionContext": true,
|
2008-10-06 06:08:15 +00:00
|
|
|
"NewArgumentsFast": true,
|
2011-06-16 14:12:58 +00:00
|
|
|
"NewStrictArgumentsFast": true,
|
2011-06-09 11:40:22 +00:00
|
|
|
"PushWithContext": true,
|
|
|
|
"PushCatchContext": true,
|
2011-08-11 16:29:28 +00:00
|
|
|
"PushBlockContext": true,
|
Get rid of static module allocation, do it in code.
Modules now have their own local scope, represented by their own context.
Module instance objects have an accessor for every export that forwards
access to the respective slot from the module's context. (Exports that are
modules themselves, however, are simple data properties.)
All modules have a _hosting_ scope/context, which (currently) is the
(innermost) enclosing global scope. To deal with recursion, nested modules
are hosted by the same scope as global ones.
For every (global or nested) module literal, the hosting context has an
internal slot that points directly to the respective module context. This
enables quick access to (statically resolved) module members by 2-dimensional
access through the hosting context. For example,
module A {
let x;
module B { let y; }
}
module C { let z; }
allocates contexts as follows:
[header| .A | .B | .C | A | C ] (global)
| | |
| | +-- [header| z ] (module)
| |
| +------- [header| y ] (module)
|
+------------ [header| x | B ] (module)
Here, .A, .B, .C are the internal slots pointing to the hosted module
contexts, whereas A, B, C hold the actual instance objects (note that every
module context also points to the respective instance object through its
extension slot in the header).
To deal with arbitrary recursion and aliases between modules,
they are created and initialized in several stages. Each stage applies to
all modules in the hosting global scope, including nested ones.
1. Allocate: for each module _literal_, allocate the module contexts and
respective instance object and wire them up. This happens in the
PushModuleContext runtime function, as generated by AllocateModules
(invoked by VisitDeclarations in the hosting scope).
2. Bind: for each module _declaration_ (i.e. literals as well as aliases),
assign the respective instance object to respective local variables. This
happens in VisitModuleDeclaration, and uses the instance objects created
in the previous stage.
For each module _literal_, this phase also constructs a module descriptor
for the next stage. This happens in VisitModuleLiteral.
3. Populate: invoke the DeclareModules runtime function to populate each
_instance_ object with accessors for it exports. This is generated by
DeclareModules (invoked by VisitDeclarations in the hosting scope again),
and uses the descriptors generated in the previous stage.
4. Initialize: execute the module bodies (and other code) in sequence. This
happens by the separate statements generated for module bodies. To reenter
the module scopes properly, the parser inserted ModuleStatements.
R=mstarzinger@chromium.org,svenpanne@chromium.org
BUG=
Review URL: https://codereview.chromium.org/11093074
git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@13033 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
2012-11-22 10:25:22 +00:00
|
|
|
"PushModuleContext": true,
|
2008-09-03 07:31:19 +00:00
|
|
|
"LazyCompile": true,
|
2010-12-07 11:31:57 +00:00
|
|
|
"LazyRecompile": true,
|
2012-07-19 18:58:23 +00:00
|
|
|
"ParallelRecompile": true,
|
2010-12-07 11:31:57 +00:00
|
|
|
"NotifyDeoptimized": true,
|
|
|
|
"NotifyOSR": true,
|
2008-09-03 07:31:19 +00:00
|
|
|
"CreateObjectLiteralBoilerplate": true,
|
2009-03-23 07:27:47 +00:00
|
|
|
"CloneLiteralBoilerplate": true,
|
|
|
|
"CloneShallowLiteralBoilerplate": true,
|
|
|
|
"CreateArrayLiteralBoilerplate": true,
|
2008-11-27 13:55:06 +00:00
|
|
|
"IS_VAR": true,
|
2009-01-06 13:24:52 +00:00
|
|
|
"ResolvePossiblyDirectEval": true,
|
2009-07-02 15:30:03 +00:00
|
|
|
"Log": true,
|
2009-10-22 11:32:12 +00:00
|
|
|
"DeclareGlobals": true,
|
2009-07-02 15:30:03 +00:00
|
|
|
|
2009-11-04 08:51:48 +00:00
|
|
|
"PromoteScheduledException": true,
|
2010-03-01 15:33:30 +00:00
|
|
|
"DeleteHandleScopeExtensions": true,
|
|
|
|
|
2011-11-08 14:39:37 +00:00
|
|
|
// Vararg with minimum number > 0.
|
|
|
|
"Call": true,
|
|
|
|
|
2011-09-13 11:42:57 +00:00
|
|
|
// Requires integer arguments to be non-negative.
|
|
|
|
"Apply": true,
|
|
|
|
|
2010-03-01 15:33:30 +00:00
|
|
|
// That can only be invoked on Array.prototype.
|
2010-03-06 01:21:34 +00:00
|
|
|
"FinishArrayPrototypeSetup": true,
|
|
|
|
|
2010-04-29 15:14:39 +00:00
|
|
|
"_SwapElements": true,
|
|
|
|
|
2011-06-30 13:36:52 +00:00
|
|
|
// Performance critical functions which cannot afford type checks.
|
|
|
|
"_IsNativeOrStrictMode": true,
|
2010-04-12 07:05:24 +00:00
|
|
|
"_CallFunction": true,
|
|
|
|
|
2010-04-13 09:31:03 +00:00
|
|
|
// Tries to allocate based on argument, and (correctly) throws
|
|
|
|
// out-of-memory if the request is too large. In practice, the
|
|
|
|
// size will be the number of captures of a RegExp.
|
|
|
|
"RegExpConstructResult": true,
|
|
|
|
"_RegExpConstructResult": true,
|
|
|
|
|
2012-03-09 11:11:55 +00:00
|
|
|
// This functions perform some checks compile time (they require one of their
|
|
|
|
// arguments to be a compile time smi).
|
|
|
|
"_DateField": true,
|
2010-04-14 14:46:15 +00:00
|
|
|
"_GetFromCache": true,
|
2010-08-12 14:38:50 +00:00
|
|
|
|
|
|
|
// This function expects its first argument to be a non-smi.
|
2010-08-27 11:47:12 +00:00
|
|
|
"_IsStringWrapperSafeForDefaultValueOf" : true,
|
|
|
|
|
|
|
|
// Only applicable to strings.
|
|
|
|
"_HasCachedArrayIndex": true,
|
2012-11-16 11:58:21 +00:00
|
|
|
"_GetCachedArrayIndex": true,
|
|
|
|
|
|
|
|
// Only for debugging parallel recompilation.
|
|
|
|
"InstallRecompiledCode": true,
|
|
|
|
"ForceParallelRecompile": true
|
2008-09-03 07:31:19 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
var currentlyUncallable = {
|
|
|
|
// We need to find a way to test this without breaking the system.
|
|
|
|
"SystemBreak": true
|
|
|
|
};
|
|
|
|
|
|
|
|
function testNatives() {
|
|
|
|
var allNatives = %ListNatives();
|
2012-09-24 10:03:49 +00:00
|
|
|
var start = 0;
|
|
|
|
var stop = (allNatives.length >> 2);
|
|
|
|
for (var i = start; i < stop; i++) {
|
2008-09-03 07:31:19 +00:00
|
|
|
var nativeInfo = allNatives[i];
|
|
|
|
var name = nativeInfo[0];
|
|
|
|
if (name in knownProblems || name in currentlyUncallable)
|
|
|
|
continue;
|
|
|
|
print(name);
|
|
|
|
var argc = nativeInfo[1];
|
2010-03-11 09:27:12 +00:00
|
|
|
testArgumentCount(name, argc);
|
2008-09-03 07:31:19 +00:00
|
|
|
testArgumentTypes(name, argc);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
testNatives();
|