1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/js/src/tests/ecma/Expressions/11.10-1.js Wed Dec 31 06:09:35 2014 +0100
1.3 @@ -0,0 +1,236 @@
1.4 +/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
1.5 +/* This Source Code Form is subject to the terms of the Mozilla Public
1.6 + * License, v. 2.0. If a copy of the MPL was not distributed with this
1.7 + * file, You can obtain one at http://mozilla.org/MPL/2.0/. */
1.8 +
1.9 +
1.10 +/**
1.11 + File Name: 11.10-1.js
1.12 + ECMA Section: 11.10-1 Binary Bitwise Operators: &
1.13 + Description:
1.14 + Semantics
1.15 +
1.16 + The production A : A @ B, where @ is one of the bitwise operators in the
1.17 + productions &, ^, | , is evaluated as follows:
1.18 +
1.19 + 1. Evaluate A.
1.20 + 2. Call GetValue(Result(1)).
1.21 + 3. Evaluate B.
1.22 + 4. Call GetValue(Result(3)).
1.23 + 5. Call ToInt32(Result(2)).
1.24 + 6. Call ToInt32(Result(4)).
1.25 + 7. Apply the bitwise operator @ to Result(5) and Result(6). The result is
1.26 + a signed 32 bit integer.
1.27 + 8. Return Result(7).
1.28 +
1.29 + Author: christine@netscape.com
1.30 + Date: 12 november 1997
1.31 +*/
1.32 +var SECTION = "11.10-1";
1.33 +var VERSION = "ECMA_1";
1.34 +startTest();
1.35 +
1.36 +writeHeaderToLog( SECTION + " Binary Bitwise Operators: &");
1.37 +
1.38 +var shiftexp = 0;
1.39 +var addexp = 0;
1.40 +
1.41 +// for ( shiftpow = 0; shiftpow < 33; shiftpow++ ) {
1.42 +for ( shiftpow = 0; shiftpow < 1; shiftpow++ ) {
1.43 + shiftexp += Math.pow( 2, shiftpow );
1.44 +
1.45 + for ( addpow = 0; addpow < 33; addpow++ ) {
1.46 + addexp += Math.pow(2, addpow);
1.47 +
1.48 + new TestCase( SECTION,
1.49 + shiftexp + " & " + addexp,
1.50 + And( shiftexp, addexp ),
1.51 + shiftexp & addexp );
1.52 + }
1.53 +}
1.54 +
1.55 +test();
1.56 +
1.57 +function ToInteger( n ) {
1.58 + n = Number( n );
1.59 + var sign = ( n < 0 ) ? -1 : 1;
1.60 +
1.61 + if ( n != n ) {
1.62 + return 0;
1.63 + }
1.64 + if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY ) {
1.65 + return n;
1.66 + }
1.67 + return ( sign * Math.floor(Math.abs(n)) );
1.68 +}
1.69 +function ToInt32( n ) {
1.70 + n = Number( n );
1.71 + var sign = ( n < 0 ) ? -1 : 1;
1.72 +
1.73 + if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {
1.74 + return 0;
1.75 + }
1.76 +
1.77 + n = (sign * Math.floor( Math.abs(n) )) % Math.pow(2,32);
1.78 + n = ( n >= Math.pow(2,31) ) ? n - Math.pow(2,32) : n;
1.79 +
1.80 + return ( n );
1.81 +}
1.82 +function ToUint32( n ) {
1.83 + n = Number( n );
1.84 + var sign = ( n < 0 ) ? -1 : 1;
1.85 +
1.86 + if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {
1.87 + return 0;
1.88 + }
1.89 + n = sign * Math.floor( Math.abs(n) )
1.90 +
1.91 + n = n % Math.pow(2,32);
1.92 +
1.93 + if ( n < 0 ){
1.94 + n += Math.pow(2,32);
1.95 + }
1.96 +
1.97 + return ( n );
1.98 +}
1.99 +function ToUint16( n ) {
1.100 + var sign = ( n < 0 ) ? -1 : 1;
1.101 +
1.102 + if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {
1.103 + return 0;
1.104 + }
1.105 +
1.106 + n = ( sign * Math.floor( Math.abs(n) ) ) % Math.pow(2,16);
1.107 +
1.108 + if (n <0) {
1.109 + n += Math.pow(2,16);
1.110 + }
1.111 +
1.112 + return ( n );
1.113 +}
1.114 +function Mask( b, n ) {
1.115 + b = ToUint32BitString( b );
1.116 + b = b.substring( b.length - n );
1.117 + b = ToUint32Decimal( b );
1.118 + return ( b );
1.119 +}
1.120 +function ToUint32BitString( n ) {
1.121 + var b = "";
1.122 + for ( p = 31; p >=0; p-- ) {
1.123 + if ( n >= Math.pow(2,p) ) {
1.124 + b += "1";
1.125 + n -= Math.pow(2,p);
1.126 + } else {
1.127 + b += "0";
1.128 + }
1.129 + }
1.130 + return b;
1.131 +}
1.132 +function ToInt32BitString( n ) {
1.133 + var b = "";
1.134 + var sign = ( n < 0 ) ? -1 : 1;
1.135 +
1.136 + b += ( sign == 1 ) ? "0" : "1";
1.137 +
1.138 + for ( p = 30; p >=0; p-- ) {
1.139 + if ( (sign == 1 ) ? sign * n >= Math.pow(2,p) : sign * n > Math.pow(2,p) ) {
1.140 + b += ( sign == 1 ) ? "1" : "0";
1.141 + n -= sign * Math.pow( 2, p );
1.142 + } else {
1.143 + b += ( sign == 1 ) ? "0" : "1";
1.144 + }
1.145 + }
1.146 +
1.147 + return b;
1.148 +}
1.149 +function ToInt32Decimal( bin ) {
1.150 + var r = 0;
1.151 + var sign;
1.152 +
1.153 + if ( Number(bin.charAt(0)) == 0 ) {
1.154 + sign = 1;
1.155 + r = 0;
1.156 + } else {
1.157 + sign = -1;
1.158 + r = -(Math.pow(2,31));
1.159 + }
1.160 +
1.161 + for ( var j = 0; j < 31; j++ ) {
1.162 + r += Math.pow( 2, j ) * Number(bin.charAt(31-j));
1.163 + }
1.164 +
1.165 + return r;
1.166 +}
1.167 +function ToUint32Decimal( bin ) {
1.168 + var r = 0;
1.169 +
1.170 +
1.171 + for ( l = bin.length; l < 32; l++ ) {
1.172 + bin = "0" + bin;
1.173 + }
1.174 +
1.175 + for ( j = 0; j < 31; j++ ) {
1.176 + r += Math.pow( 2, j ) * Number(bin.charAt(31-j));
1.177 +
1.178 + }
1.179 +
1.180 + return r;
1.181 +}
1.182 +function And( s, a ) {
1.183 + s = ToInt32( s );
1.184 + a = ToInt32( a );
1.185 +
1.186 + var bs = ToInt32BitString( s );
1.187 + var ba = ToInt32BitString( a );
1.188 +
1.189 + var result = "";
1.190 +
1.191 + for ( var bit = 0; bit < bs.length; bit++ ) {
1.192 + if ( bs.charAt(bit) == "1" && ba.charAt(bit) == "1" ) {
1.193 + result += "1";
1.194 + } else {
1.195 + result += "0";
1.196 + }
1.197 + }
1.198 + return ToInt32Decimal(result);
1.199 +}
1.200 +function Xor( s, a ) {
1.201 + s = ToInt32( s );
1.202 + a = ToInt32( a );
1.203 +
1.204 + var bs = ToInt32BitString( s );
1.205 + var ba = ToInt32BitString( a );
1.206 +
1.207 + var result = "";
1.208 +
1.209 + for ( var bit = 0; bit < bs.length; bit++ ) {
1.210 + if ( (bs.charAt(bit) == "1" && ba.charAt(bit) == "0") ||
1.211 + (bs.charAt(bit) == "0" && ba.charAt(bit) == "1")
1.212 + ) {
1.213 + result += "1";
1.214 + } else {
1.215 + result += "0";
1.216 + }
1.217 + }
1.218 +
1.219 + return ToInt32Decimal(result);
1.220 +}
1.221 +function Or( s, a ) {
1.222 + s = ToInt32( s );
1.223 + a = ToInt32( a );
1.224 +
1.225 + var bs = ToInt32BitString( s );
1.226 + var ba = ToInt32BitString( a );
1.227 +
1.228 + var result = "";
1.229 +
1.230 + for ( var bit = 0; bit < bs.length; bit++ ) {
1.231 + if ( bs.charAt(bit) == "1" || ba.charAt(bit) == "1" ) {
1.232 + result += "1";
1.233 + } else {
1.234 + result += "0";
1.235 + }
1.236 + }
1.237 +
1.238 + return ToInt32Decimal(result);
1.239 +}
