js/src/tests/js1_5/Expressions/regress-96526-noargsub.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 /* -*- 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: 29 Oct 2002
michael@0 9 * SUMMARY: Testing "use" and "set" operations on expressions like a[i][j][k]
michael@0 10 * See http://bugzilla.mozilla.org/show_bug.cgi?id=96526#c52
michael@0 11 *
michael@0 12 * Brendan: "The idea is to cover all the 'use' and 'set' (as in modify)
michael@0 13 * operations you can do on an expression like a[i][j][k], including variations
michael@0 14 * where you replace |a| with arguments (literally) and |i| with 0, 1, 2, etc.
michael@0 15 * (to hit the optimization for arguments[0]... that uses JSOP_ARGSUB)."
michael@0 16 */
michael@0 17 //-----------------------------------------------------------------------------
michael@0 18 var UBound = 0;
michael@0 19 var BUGNUMBER = 96526;
michael@0 20 var summary = 'Testing "use" and "set" ops on expressions like a[i][j][k]';
michael@0 21 var status = '';
michael@0 22 var statusitems = [];
michael@0 23 var actual = '';
michael@0 24 var actualvalues = [];
michael@0 25 var expect= '';
michael@0 26 var expectedvalues = [];
michael@0 27
michael@0 28 var z='magic';
michael@0 29 Number.prototype.magic=42;
michael@0 30
michael@0 31 status = inSection(1);
michael@0 32 actual = f(2,1,[-1,0,[1,2,[3,4]]]);
michael@0 33 expect = 42;
michael@0 34 addThis();
michael@0 35
michael@0 36
michael@0 37 function f(j,k,a)
michael@0 38 {
michael@0 39 status = inSection(2);
michael@0 40 actual = formatArray(a[2]);
michael@0 41 expect = formatArray([1,2,[3,4]]);
michael@0 42 addThis();
michael@0 43
michael@0 44 status = inSection(3);
michael@0 45 actual = formatArray(a[2][j]);
michael@0 46 expect = formatArray([3,4]);
michael@0 47 addThis();
michael@0 48
michael@0 49 status = inSection(4);
michael@0 50 actual = a[2][j][k];
michael@0 51 expect = 4;
michael@0 52 addThis();
michael@0 53
michael@0 54 status = inSection(5);
michael@0 55 actual = a[2][j][k][z];
michael@0 56 expect = 42;
michael@0 57 addThis();
michael@0 58
michael@0 59 return a[2][j][k][z];
michael@0 60 }
michael@0 61
michael@0 62
michael@0 63
michael@0 64 //-----------------------------------------------------------------------------
michael@0 65 test();
michael@0 66 //-----------------------------------------------------------------------------
michael@0 67
michael@0 68
michael@0 69
michael@0 70 function addThis()
michael@0 71 {
michael@0 72 statusitems[UBound] = status;
michael@0 73 actualvalues[UBound] = actual;
michael@0 74 expectedvalues[UBound] = expect;
michael@0 75 UBound++;
michael@0 76 }
michael@0 77
michael@0 78
michael@0 79 function test()
michael@0 80 {
michael@0 81 enterFunc('test');
michael@0 82 printBugNumber(BUGNUMBER);
michael@0 83 printStatus(summary);
michael@0 84
michael@0 85 for (var i=0; i<UBound; i++)
michael@0 86 {
michael@0 87 reportCompare(expectedvalues[i], actualvalues[i], statusitems[i]);
michael@0 88 }
michael@0 89
michael@0 90 exitFunc ('test');
michael@0 91 }

mercurial