Index: test/mjsunit/fuzz-natives.js |
diff --git a/test/mjsunit/fuzz-natives.js b/test/mjsunit/fuzz-natives.js |
deleted file mode 100644 |
index 225a44d8a514a665d2d89d3f7d9ca6b01fb022c2..0000000000000000000000000000000000000000 |
--- a/test/mjsunit/fuzz-natives.js |
+++ /dev/null |
@@ -1,220 +0,0 @@ |
-// Copyright 2011 the V8 project authors. All rights reserved. |
-// 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. |
- |
-// Flags: --allow-natives-syntax |
- |
-var RUN_WITH_ALL_ARGUMENT_ENTRIES = false; |
-var kOnManyArgumentsRemove = 5; |
- |
-function makeArguments() { |
- var result = [ ]; |
- result.push(17); |
- result.push(-31); |
- result.push(new Array(100)); |
- result.push(new Array(100003)); |
- 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 + ");"); |
-} |
- |
-function testArgumentCount(name, argc) { |
- for (var i = 0; i < 10; i++) { |
- var func = null; |
- try { |
- func = makeFunction(name, i); |
- } catch (e) { |
- if (e != "SyntaxError: Illegal access") throw e; |
- } |
- if (func === null && i == argc) { |
- throw "unexpected exception"; |
- } |
- 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(); |
- // 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); |
- } |
- } |
- var current = type; |
- var hasMore = false; |
- var argList = [ ]; |
- for (var i = 0; i < argc; i++) { |
- var index = current % numArguments; |
- current = (current / numArguments) << 0; |
- if (index != (numArguments - 1)) |
- 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, |
- |
- // Avoid calling the concat operation, because weird lengths |
- // may lead to out-of-memory. Ditto for StringBuilderJoin. |
- "StringBuilderConcat": true, |
- "StringBuilderJoin": true, |
- |
- // 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, |
- |
- // Too slow. |
- "DebugReferencedBy": true, |
- |
- // Calling disable/enable access checks may interfere with the |
- // the rest of the tests. |
- "DisableAccessChecks": true, |
- "EnableAccessChecks": true, |
- |
- // These functions should not be callable as runtime functions. |
- "NewFunctionContext": true, |
- "NewArgumentsFast": true, |
- "NewStrictArgumentsFast": true, |
- "PushWithContext": true, |
- "PushCatchContext": true, |
- "PushBlockContext": true, |
- "LazyCompile": true, |
- "LazyRecompile": true, |
- "ParallelRecompile": true, |
- "NotifyDeoptimized": true, |
- "NotifyOSR": true, |
- "CreateObjectLiteralBoilerplate": true, |
- "CloneLiteralBoilerplate": true, |
- "CloneShallowLiteralBoilerplate": true, |
- "CreateArrayLiteralBoilerplate": true, |
- "IS_VAR": true, |
- "ResolvePossiblyDirectEval": true, |
- "Log": true, |
- "DeclareGlobals": true, |
- |
- "PromoteScheduledException": true, |
- "DeleteHandleScopeExtensions": true, |
- |
- // Vararg with minimum number > 0. |
- "Call": true, |
- |
- // Requires integer arguments to be non-negative. |
- "Apply": true, |
- |
- // That can only be invoked on Array.prototype. |
- "FinishArrayPrototypeSetup": true, |
- |
- "_SwapElements": true, |
- |
- // Performance critical functions which cannot afford type checks. |
- "_IsNativeOrStrictMode": true, |
- "_CallFunction": true, |
- |
- // 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, |
- |
- // This functions perform some checks compile time (they require one of their |
- // arguments to be a compile time smi). |
- "_DateField": true, |
- "_GetFromCache": true, |
- |
- // This function expects its first argument to be a non-smi. |
- "_IsStringWrapperSafeForDefaultValueOf" : true, |
- |
- // Only applicable to strings. |
- "_HasCachedArrayIndex": true, |
- "_GetCachedArrayIndex": true |
-}; |
- |
-var currentlyUncallable = { |
- // We need to find a way to test this without breaking the system. |
- "SystemBreak": true |
-}; |
- |
-function testNatives() { |
- var allNatives = %ListNatives(); |
- for (var i = 0; i < allNatives.length; i++) { |
- var nativeInfo = allNatives[i]; |
- var name = nativeInfo[0]; |
- if (name in knownProblems || name in currentlyUncallable) |
- continue; |
- print(name); |
- var argc = nativeInfo[1]; |
- testArgumentCount(name, argc); |
- testArgumentTypes(name, argc); |
- } |
-} |
- |
-testNatives(); |