Wed, 31 Dec 2014 06:09:35 +0100
Cloned upstream origin tor-browser at tor-browser-31.3.0esr-4.5-1-build1
revision ID fc1c9ff7c1b2defdbc039f12214767608f46423f for hacking purpose.
michael@0 | 1 | /* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */ |
michael@0 | 2 | /* This Source Code Form is subject to the terms of the Mozilla Public |
michael@0 | 3 | * License, v. 2.0. If a copy of the MPL was not distributed with this |
michael@0 | 4 | * file, You can obtain one at http://mozilla.org/MPL/2.0/. */ |
michael@0 | 5 | |
michael@0 | 6 | /* |
michael@0 | 7 | * |
michael@0 | 8 | * Date: 31 Oct 2002 |
michael@0 | 9 | * SUMMARY: Testing script with at least 64K of different string literals |
michael@0 | 10 | * See http://bugzilla.mozilla.org/show_bug.cgi?id=159334 |
michael@0 | 11 | * |
michael@0 | 12 | * Testing that script engine can handle scripts with at least 64K of different |
michael@0 | 13 | * string literals. The following will evaluate, via eval(), a script like this: |
michael@0 | 14 | * |
michael@0 | 15 | * f('0') |
michael@0 | 16 | * f('1') |
michael@0 | 17 | * ... |
michael@0 | 18 | * f('N - 1') |
michael@0 | 19 | * |
michael@0 | 20 | * where N is 0xFFFE |
michael@0 | 21 | * |
michael@0 | 22 | */ |
michael@0 | 23 | //----------------------------------------------------------------------------- |
michael@0 | 24 | var UBound = 0; |
michael@0 | 25 | var BUGNUMBER = 159334; |
michael@0 | 26 | var summary = 'Testing script with at least 64K of different string literals'; |
michael@0 | 27 | var status = ''; |
michael@0 | 28 | var statusitems = []; |
michael@0 | 29 | var actual = ''; |
michael@0 | 30 | var actualvalues = []; |
michael@0 | 31 | var expect= ''; |
michael@0 | 32 | var expectedvalues = []; |
michael@0 | 33 | |
michael@0 | 34 | |
michael@0 | 35 | var N = 0xFFFE; |
michael@0 | 36 | |
michael@0 | 37 | // Create big string for eval recursively to avoid N*N behavior |
michael@0 | 38 | // on string concatenation |
michael@0 | 39 | var long_eval = buildEval_r(0, N); |
michael@0 | 40 | |
michael@0 | 41 | // Run it |
michael@0 | 42 | var test_sum = 0; |
michael@0 | 43 | function f(str) { test_sum += Number(str); } |
michael@0 | 44 | eval(long_eval); |
michael@0 | 45 | |
michael@0 | 46 | status = inSection(1); |
michael@0 | 47 | actual = (test_sum == N * (N - 1) / 2); |
michael@0 | 48 | expect = true; |
michael@0 | 49 | addThis(); |
michael@0 | 50 | |
michael@0 | 51 | |
michael@0 | 52 | |
michael@0 | 53 | //----------------------------------------------------------------------------- |
michael@0 | 54 | test(); |
michael@0 | 55 | //----------------------------------------------------------------------------- |
michael@0 | 56 | |
michael@0 | 57 | |
michael@0 | 58 | |
michael@0 | 59 | function buildEval_r(beginLine, endLine) |
michael@0 | 60 | { |
michael@0 | 61 | var count = endLine - beginLine; |
michael@0 | 62 | |
michael@0 | 63 | if (count == 0) |
michael@0 | 64 | return ""; |
michael@0 | 65 | |
michael@0 | 66 | if (count == 1) |
michael@0 | 67 | return "f('" + beginLine + "')\n"; |
michael@0 | 68 | |
michael@0 | 69 | var middle = beginLine + (count >>> 1); |
michael@0 | 70 | return buildEval_r(beginLine, middle) + buildEval_r(middle, endLine); |
michael@0 | 71 | } |
michael@0 | 72 | |
michael@0 | 73 | |
michael@0 | 74 | function addThis() |
michael@0 | 75 | { |
michael@0 | 76 | statusitems[UBound] = status; |
michael@0 | 77 | actualvalues[UBound] = actual; |
michael@0 | 78 | expectedvalues[UBound] = expect; |
michael@0 | 79 | UBound++; |
michael@0 | 80 | } |
michael@0 | 81 | |
michael@0 | 82 | |
michael@0 | 83 | function test() |
michael@0 | 84 | { |
michael@0 | 85 | enterFunc('test'); |
michael@0 | 86 | printBugNumber(BUGNUMBER); |
michael@0 | 87 | printStatus(summary); |
michael@0 | 88 | |
michael@0 | 89 | for (var i=0; i<UBound; i++) |
michael@0 | 90 | { |
michael@0 | 91 | reportCompare(expectedvalues[i], actualvalues[i], statusitems[i]); |
michael@0 | 92 | } |
michael@0 | 93 | |
michael@0 | 94 | exitFunc ('test'); |
michael@0 | 95 | } |