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: 08 February 2003 |
michael@0 | 9 | * SUMMARY: Parser recursion should check stack overflow |
michael@0 | 10 | * |
michael@0 | 11 | * See http://bugzilla.mozilla.org/show_bug.cgi?id=192414 |
michael@0 | 12 | * |
michael@0 | 13 | */ |
michael@0 | 14 | //----------------------------------------------------------------------------- |
michael@0 | 15 | var UBound = 0; |
michael@0 | 16 | var BUGNUMBER = 192414; |
michael@0 | 17 | var summary = 'Parser recursion should check stack overflow'; |
michael@0 | 18 | var status = ''; |
michael@0 | 19 | var statusitems = []; |
michael@0 | 20 | var actual = ''; |
michael@0 | 21 | var actualvalues = []; |
michael@0 | 22 | var expect= ''; |
michael@0 | 23 | var expectedvalues = []; |
michael@0 | 24 | |
michael@0 | 25 | /* |
michael@0 | 26 | * We will form an eval string to set the result-variable |actual|. |
michael@0 | 27 | * To get a feel for this, suppose N were 3. Then the eval string is |
michael@0 | 28 | * 'actual = (1&(1&(1&1)));' The expected value after eval() is 1. |
michael@0 | 29 | */ |
michael@0 | 30 | status = inSection(1); |
michael@0 | 31 | var N = 10000; |
michael@0 | 32 | var left = repeat_str('(1&', N); |
michael@0 | 33 | var right = repeat_str(')', N); |
michael@0 | 34 | var str = 'actual = '.concat(left, '1', right, ';'); |
michael@0 | 35 | try |
michael@0 | 36 | { |
michael@0 | 37 | eval(str); |
michael@0 | 38 | } |
michael@0 | 39 | catch (e) |
michael@0 | 40 | { |
michael@0 | 41 | /* |
michael@0 | 42 | * An exception during this eval is OK, as the runtime can throw one |
michael@0 | 43 | * in response to too deep recursion. We haven't crashed; good! |
michael@0 | 44 | */ |
michael@0 | 45 | actual = 1; |
michael@0 | 46 | } |
michael@0 | 47 | expect = 1; |
michael@0 | 48 | addThis(); |
michael@0 | 49 | |
michael@0 | 50 | |
michael@0 | 51 | |
michael@0 | 52 | //----------------------------------------------------------------------------- |
michael@0 | 53 | test(); |
michael@0 | 54 | //----------------------------------------------------------------------------- |
michael@0 | 55 | |
michael@0 | 56 | |
michael@0 | 57 | |
michael@0 | 58 | function repeat_str(str, repeat_count) |
michael@0 | 59 | { |
michael@0 | 60 | var arr = new Array(--repeat_count); |
michael@0 | 61 | while (repeat_count != 0) |
michael@0 | 62 | arr[--repeat_count] = str; |
michael@0 | 63 | return str.concat.apply(str, arr); |
michael@0 | 64 | } |
michael@0 | 65 | |
michael@0 | 66 | |
michael@0 | 67 | function addThis() |
michael@0 | 68 | { |
michael@0 | 69 | statusitems[UBound] = status; |
michael@0 | 70 | actualvalues[UBound] = actual; |
michael@0 | 71 | expectedvalues[UBound] = expect; |
michael@0 | 72 | UBound++; |
michael@0 | 73 | } |
michael@0 | 74 | |
michael@0 | 75 | |
michael@0 | 76 | function test() |
michael@0 | 77 | { |
michael@0 | 78 | enterFunc('test'); |
michael@0 | 79 | printBugNumber(BUGNUMBER); |
michael@0 | 80 | printStatus(summary); |
michael@0 | 81 | |
michael@0 | 82 | for (var i=0; i<UBound; i++) |
michael@0 | 83 | { |
michael@0 | 84 | reportCompare(expectedvalues[i], actualvalues[i], statusitems[i]); |
michael@0 | 85 | } |
michael@0 | 86 | |
michael@0 | 87 | exitFunc ('test'); |
michael@0 | 88 | } |