auto import from //depot/cupcake/@135843

1 files changed, 215 insertions, 0 deletions

diff --git a/JavaScriptCore/tests/mozilla/ecma/Expressions/11.4.8.js b/JavaScriptCore/tests/mozilla/ecma/Expressions/11.4.8.js
new file mode 100644
index 0000000..491167f
--- /dev/null
+++ b/JavaScriptCore/tests/mozilla/ecma/Expressions/11.4.8.js
@@ -0,0 +1,215 @@
+/* The contents of this file are subject to the Netscape 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/NPL/
+ *
+ * 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 Mozilla Communicator client code, released March
+ * 31, 1998.
+ *
+ * The Initial Developer of the Original Code is Netscape Communications
+ * Corporation. Portions created by Netscape are
+ * Copyright (C) 1998 Netscape Communications Corporation. All
+ * Rights Reserved.
+ *
+ * Contributor(s): 
+ * 
+ */
+            /**
+    File Name:          11.4.8.js
+    ECMA Section:       11.4.8 Bitwise NOT Operator
+    Description:        flip bits up to 32 bits
+                        no special cases
+    Author:             christine@netscape.com
+    Date:               7 july 1997
+
+    Data File Fields:
+        VALUE           value passed as an argument to the ~ operator
+        E_RESULT        expected return value of ~ VALUE;
+
+    Static variables:
+        none
+
+*/
+
+    var SECTION = "11.4.8";
+    var VERSION = "ECMA_1";
+    startTest();
+    var testcases = getTestCases();
+
+    writeHeaderToLog( SECTION + " Bitwise Not operator");
+    test();
+
+function test() {
+    for ( tc=0; tc < testcases.length; tc++ ) {
+        testcases[tc].passed = writeTestCaseResult(
+                            testcases[tc].expect,
+                            testcases[tc].actual,
+                            testcases[tc].description +" = "+
+                            testcases[tc].actual );
+
+        testcases[tc].reason += ( testcases[tc].passed ) ? "" : "wrong value ";
+    }
+    stopTest();
+    return ( testcases );
+}
+function getTestCases() {
+    var array = new Array();
+    var item = 0;
+
+    for ( var i = 0; i < 35; i++ ) {
+        var p = Math.pow(2,i);
+
+        array[item++] = new TestCase( SECTION, "~"+p,   Not(p),     ~p );
+
+    }
+    for ( i = 0; i < 35; i++ ) {
+        var p = -Math.pow(2,i);
+
+        array[item++] = new TestCase( SECTION, "~"+p,   Not(p),     ~p );
+
+    }
+
+    return ( array );
+}
+function ToInteger( n ) {
+    n = Number( n );
+    var sign = ( n < 0 ) ? -1 : 1;
+
+    if ( n != n ) {
+        return 0;
+    }
+    if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY ) {
+        return n;
+    }
+    return ( sign * Math.floor(Math.abs(n)) );
+}
+function ToInt32( n ) {
+    n = Number( n );
+    var sign = ( n < 0 ) ? -1 : 1;
+
+    if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {
+        return 0;
+    }
+
+    n = (sign * Math.floor( Math.abs(n) )) % Math.pow(2,32);
+    n = ( n >= Math.pow(2,31) ) ? n - Math.pow(2,32) : n;
+
+    return ( n );
+}
+function ToUint32( n ) {
+    n = Number( n );
+    var sign = ( n < 0 ) ? -1 : 1;
+
+    if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {
+        return 0;
+    }
+    n = sign * Math.floor( Math.abs(n) )
+
+    n = n % Math.pow(2,32);
+
+    if ( n < 0 ){
+        n += Math.pow(2,32);
+    }
+
+    return ( n );
+}
+function ToUint16( n ) {
+    var sign = ( n < 0 ) ? -1 : 1;
+
+    if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {
+        return 0;
+    }
+
+    n = ( sign * Math.floor( Math.abs(n) ) ) % Math.pow(2,16);
+
+    if (n <0) {
+        n += Math.pow(2,16);
+    }
+
+    return ( n );
+}
+function Mask( b, n ) {
+    b = ToUint32BitString( b );
+    b = b.substring( b.length - n );
+    b = ToUint32Decimal( b );
+    return ( b );
+}
+function ToUint32BitString( n ) {
+    var b = "";
+    for ( p = 31; p >=0; p-- ) {
+        if ( n >= Math.pow(2,p) ) {
+            b += "1";
+            n -= Math.pow(2,p);
+        } else {
+            b += "0";
+        }
+    }
+    return b;
+}
+function ToInt32BitString( n ) {
+    var b = "";
+    var sign = ( n < 0 ) ? -1 : 1;
+
+    b += ( sign == 1 ) ? "0" : "1";
+
+    for ( p = 30; p >=0; p-- ) {
+        if ( (sign == 1 ) ? sign * n >= Math.pow(2,p) : sign * n > Math.pow(2,p) ) {
+            b += ( sign == 1 ) ? "1" : "0";
+            n -= sign * Math.pow( 2, p );
+        } else {
+            b += ( sign == 1 ) ? "0" : "1";
+        }
+    }
+
+    return b;
+}
+function ToInt32Decimal( bin ) {
+    var r = 0;
+    var sign;
+
+    if ( Number(bin.charAt(0)) == 0 ) {
+        sign = 1;
+        r = 0;
+    } else {
+        sign = -1;
+        r = -(Math.pow(2,31));
+    }
+
+    for ( var j = 0; j < 31; j++ ) {
+        r += Math.pow( 2, j ) * Number(bin.charAt(31-j));
+    }
+
+    return r;
+}
+function ToUint32Decimal( bin ) {
+    var r = 0;
+
+    for ( l = bin.length; l < 32; l++ ) {
+        bin = "0" + bin;
+    }
+
+    for ( j = 0; j < 31; j++ ) {
+        r += Math.pow( 2, j ) * Number(bin.charAt(31-j));
+    }
+
+    return r;
+}
+function Not( n ) {
+    n = ToInt32(n);
+    n = ToInt32BitString(n);
+
+    r = ""
+
+    for( var l = 0; l < n.length; l++  ) {
+        r += ( n.charAt(l) == "0" ) ? "1" : "0";
+    }
+
+    n = ToInt32Decimal(r);
+
+    return n;
+}
\ No newline at end of file