• file
• revisions
• annotate
• diff
• comparison
• raw

js/src/tests/js1_5/Array/regress-101964.js@129ffea94266 (annotated)

js/src/tests/js1_5/Array/regress-101964.js

Sat, 03 Jan 2015 20:18:00 +0100

author

Michael Schloh von Bennewitz <michael@schloh.com>

date

Sat, 03 Jan 2015 20:18:00 +0100

branch

TOR_BUG_3246

changeset 7

129ffea94266

permissions

-rw-r--r--

Conditionally enable double key logic according to:
private browsing mode or privacy.thirdparty.isolate preference and
implement in GetCookieStringCommon and FindCookie where it counts...
With some reservations of how to convince FindCookie users to test
condition and pass a nullptr when disabling double key logic.

michael@0	1	// |reftest| random -- bogus perf test (bug 467263)
michael@0	2	/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
michael@0	3	/* This Source Code Form is subject to the terms of the Mozilla Public
michael@0	4	* License, v. 2.0. If a copy of the MPL was not distributed with this
michael@0	5	* file, You can obtain one at http://mozilla.org/MPL/2.0/.
michael@0	6
michael@0	7	/*
michael@0	8	* Date: 27 September 2001
michael@0	9	*
michael@0	10	* SUMMARY: Performance: truncating even very large arrays should be fast!
michael@0	11	* See http://bugzilla.mozilla.org/show_bug.cgi?id=101964
michael@0	12	*
michael@0	13	* Adjust this testcase if necessary. The FAST constant defines
michael@0	14	* an upper bound in milliseconds for any truncation to take.
michael@0	15	*/
michael@0	16	//-----------------------------------------------------------------------------
michael@0	17	var UBound = 0;
michael@0	18	var BUGNUMBER = 101964;
michael@0	19	var summary = 'Performance: truncating even very large arrays should be fast!';
michael@0	20	var BIG = 10000000;
michael@0	21	var LITTLE = 10;
michael@0	22	var FAST = 50; // array truncation should be 50 ms or less to pass the test
michael@0	23	var MSG_FAST = 'Truncation took less than ' + FAST + ' ms';
michael@0	24	var MSG_SLOW = 'Truncation took ';
michael@0	25	var MSG_MS = ' ms';
michael@0	26	var status = '';
michael@0	27	var statusitems = [];
michael@0	28	var actual = '';
michael@0	29	var actualvalues = [];
michael@0	30	var expect= '';
michael@0	31	var expectedvalues = [];
michael@0	32
michael@0	33
michael@0	34
michael@0	35	status = inSection(1);
michael@0	36	var arr = Array(BIG);
michael@0	37	var start = new Date();
michael@0	38	arr.length = LITTLE;
michael@0	39	actual = elapsedTime(start);
michael@0	40	expect = FAST;
michael@0	41	addThis();
michael@0	42
michael@0	43
michael@0	44
michael@0	45	//-----------------------------------------------------------------------------
michael@0	46	test();
michael@0	47	//-----------------------------------------------------------------------------
michael@0	48
michael@0	49
michael@0	50
michael@0	51	function elapsedTime(startTime)
michael@0	52	{
michael@0	53	return new Date() - startTime;
michael@0	54	}
michael@0	55
michael@0	56
michael@0	57	function addThis()
michael@0	58	{
michael@0	59	statusitems[UBound] = status;
michael@0	60	actualvalues[UBound] = isThisFast(actual);
michael@0	61	expectedvalues[UBound] = isThisFast(expect);
michael@0	62	UBound++;
michael@0	63	}
michael@0	64
michael@0	65
michael@0	66	function isThisFast(ms)
michael@0	67	{
michael@0	68	if (ms <= FAST)
michael@0	69	return MSG_FAST;
michael@0	70	return MSG_SLOW + ms + MSG_MS;
michael@0	71	}
michael@0	72
michael@0	73
michael@0	74	function test()
michael@0	75	{
michael@0	76	enterFunc ('test');
michael@0	77	printBugNumber(BUGNUMBER);
michael@0	78	printStatus (summary);
michael@0	79
michael@0	80	for (var i=0; i<UBound; i++)
michael@0	81	{
michael@0	82	reportCompare(expectedvalues[i], actualvalues[i], statusitems[i]);
michael@0	83	}
michael@0	84
michael@0	85	exitFunc ('test');
michael@0	86	}