gecko-dev/js/tests/js1_5/Regress/regress-313967-02.js

88 lines
2.7 KiB
JavaScript
Executable File

/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
/* ***** BEGIN LICENSE BLOCK *****
* Version: MPL 1.1/GPL 2.0/LGPL 2.1
*
* The contents of this file are subject to the Mozilla Public License Version
* 1.1 (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
* http://www.mozilla.org/MPL/
*
* Software distributed under the License is distributed on an "AS IS" basis,
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
* for the specific language governing rights and limitations under the
* License.
*
* The Original Code is JavaScript Engine testing utilities.
*
* The Initial Developer of the Original Code is
* Mozilla Foundation.
* Portions created by the Initial Developer are Copyright (C) 2006
* the Initial Developer. All Rights Reserved.
*
* Contributor(s): Julien Lecomte
* Igor Bukanov
*
* Alternatively, the contents of this file may be used under the terms of
* either the GNU General Public License Version 2 or later (the "GPL"), or
* the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
* in which case the provisions of the GPL or the LGPL are applicable instead
* of those above. If you wish to allow use of your version of this file only
* under the terms of either the GPL or the LGPL, and not to allow others to
* use your version of this file under the terms of the MPL, indicate your
* decision by deleting the provisions above and replace them with the notice
* and other provisions required by the GPL or the LGPL. If you do not delete
* the provisions above, a recipient may use your version of this file under
* the terms of any one of the MPL, the GPL or the LGPL.
*
* ***** END LICENSE BLOCK ***** */
var gTestfile = 'regress-313967-02.js';
//-----------------------------------------------------------------------------
var BUGNUMBER = 313967;
var summary = 'Compile time of N functions should be O(N)';
var actual = '';
var expect = '';
printBugNumber(BUGNUMBER);
printStatus (summary);
function F(x, y) {
var a = x+y;
var b = x-y;
var c = a+b;
return ( 2*c-1 );
}
function test(N)
{
var src = F.toSource(-1)+"\n";
src = Array(N + 1).join(src);
var counter = 0;
src = src.replace(/F/g, function() { ++counter; return "F"+counter; })
var now = Date.now;
var t = now();
eval(src);
return now() - t;
}
var data = {X:[], Y:[]};
for (var i = 0; i != 10; ++i)
{
data.X.push(i);
data.Y.push(test(1000 + i * 2000));
gc();
}
var order = BigO(data);
var msg = '';
for (var p = 0; p < data.X.length; p++)
{
msg += '(' + data.X[p] + ', ' + data.Y[p] + '); ';
}
print(msg);
reportCompare(true, order < 2, summary + ': BigO ' + order + ' < 2');