bigint bitwise and, or, xor

2017-10-18 11:47:42 -07:00 · 2017-10-18 11:47:42 -07:00 · 96ba34c240
parent d38701abc8
commit 96ba34c240
6 changed files with 452 additions and 0 deletions
--- a/test/language/expressions/bitwise-and/bigint-non-primitive.js
+++ b/test/language/expressions/bitwise-and/bigint-non-primitive.js
@ -0,0 +1,43 @@
+// Copyright (C) 2017 Josh Wolfe. All rights reserved.
+// This code is governed by the BSD license found in the LICENSE file.
+
+/*---
+description: Bitwise AND for BigInt non-primitive values
+esid: sec-binary-bitwise-operators-runtime-semantics-evaluation
+info: |
+
+  5. Let lnum be ? ToNumeric(lval).
+  6. Let rnum be ? ToNumeric(rval).
+  ...
+  8. Let T be Type(lnum).
+  9. If @ is &, return T::bitwiseAND(lnum, rnum).
+
+features: [BigInt]
+---*/
+
+assert.sameValue(Object(5n) & 3n, 1n, "Object(5n) & 3n === 1n");
+assert.sameValue(3n & Object(5n), 1n, "3n & Object(5n) === 1n");
+assert.sameValue(Object(5n) & Object(3n), 1n, "Object(5n) & Object(3n) === 1n");
+
+function err() {
+  throw new Test262Error();
+}
+
+assert.sameValue(
+  {[Symbol.toPrimitive]: function() { return 5n; }, valueOf: err, toString: err} & 3n, 1n,
+  "primitive from @@toPrimitive");
+assert.sameValue(
+  3n & {[Symbol.toPrimitive]: function() { return 5n; }, valueOf: err, toString: err}, 1n,
+  "primitive from @@toPrimitive");
+assert.sameValue(
+  {valueOf: function() { return 5n; }, toString: err} & 3n, 1n,
+  "primitive from {}.valueOf");
+assert.sameValue(
+  3n & {valueOf: function() { return 5n; }, toString: err}, 1n,
+  "primitive from {}.valueOf");
+assert.sameValue(
+  {toString: function() { return 5n; }} & 3n, 1n,
+  "primitive from {}.toString");
+assert.sameValue(
+  3n & {toString: function() { return 5n; }}, 1n,
+  "primitive from {}.toString");
--- a/test/language/expressions/bitwise-and/bigint.js
+++ b/test/language/expressions/bitwise-and/bigint.js
@ -0,0 +1,107 @@
+// Copyright (C) 2017 Josh Wolfe. All rights reserved.
+// This code is governed by the BSD license found in the LICENSE file.
+
+/*---
+description: Bitwise AND for BigInt values
+esid: sec-bitwise-op
+info: |
+  BitwiseOp(op, x, y)
+
+  1. Let result be 0.
+  2. Let shift be 0.
+  3. Repeat, until (x = 0 or x = -1) and (y = 0 or y = -1),
+    a. Let xDigit be x modulo 2.
+    b. Let yDigit be y modulo 2.
+    c. Let result be result + 2**shift * op(xDigit, yDigit)
+    d. Let shift be shift + 1.
+    e. Let x be (x - xDigit) / 2.
+    f. Let y be (y - yDigit) / 2.
+  4. If op(x modulo 2, y modulo 2) ≠ 0,
+    a. Let result be result - 2**shift. NOTE: This extends the sign.
+  5. Return result.
+
+features: [BigInt]
+---*/
+
+assert.sameValue(0n & 0n, 0n, "0n & 0n === 0n");
+assert.sameValue(0n & 1n, 0n, "0n & 1n === 0n");
+assert.sameValue(1n & 0n, 0n, "1n & 0n === 0n");
+assert.sameValue(0n & 2n, 0n, "0n & 2n === 0n");
+assert.sameValue(2n & 0n, 0n, "2n & 0n === 0n");
+assert.sameValue(0n & 3n, 0n, "0n & 3n === 0n");
+assert.sameValue(3n & 0n, 0n, "3n & 0n === 0n");
+assert.sameValue(1n & 1n, 1n, "1n & 1n === 1n");
+assert.sameValue(1n & 2n, 0n, "1n & 2n === 0n");
+assert.sameValue(2n & 1n, 0n, "2n & 1n === 0n");
+assert.sameValue(1n & 3n, 1n, "1n & 3n === 1n");
+assert.sameValue(3n & 1n, 1n, "3n & 1n === 1n");
+assert.sameValue(2n & 2n, 2n, "2n & 2n === 2n");
+assert.sameValue(2n & 3n, 2n, "2n & 3n === 2n");
+assert.sameValue(3n & 2n, 2n, "3n & 2n === 2n");
+assert.sameValue(0xffffffffn & 0n, 0n, "0xffffffffn & 0n === 0n");
+assert.sameValue(0n & 0xffffffffn, 0n, "0n & 0xffffffffn === 0n");
+assert.sameValue(0xffffffffn & 0xffffffffn, 0xffffffffn, "0xffffffffn & 0xffffffffn === 0xffffffffn");
+assert.sameValue(0xffffffffffffffffn & 0n, 0n, "0xffffffffffffffffn & 0n === 0n");
+assert.sameValue(0n & 0xffffffffffffffffn, 0n, "0n & 0xffffffffffffffffn === 0n");
+assert.sameValue(0xffffffffffffffffn & 0xffffffffn, 0xffffffffn, "0xffffffffffffffffn & 0xffffffffn === 0xffffffffn");
+assert.sameValue(0xffffffffn & 0xffffffffffffffffn, 0xffffffffn, "0xffffffffn & 0xffffffffffffffffn === 0xffffffffn");
+assert.sameValue(
+  0xffffffffffffffffn & 0xffffffffffffffffn, 0xffffffffffffffffn,
+  "0xffffffffffffffffn & 0xffffffffffffffffn === 0xffffffffffffffffn");
+assert.sameValue(
+  0xbf2ed51ff75d380fd3be813ec6185780n & 0x4aabef2324cedff5387f1f65n, 0x42092803008e813400181700n,
+  "0xbf2ed51ff75d380fd3be813ec6185780n & 0x4aabef2324cedff5387f1f65n === 0x42092803008e813400181700n");
+assert.sameValue(
+  0x4aabef2324cedff5387f1f65n & 0xbf2ed51ff75d380fd3be813ec6185780n, 0x42092803008e813400181700n,
+  "0x4aabef2324cedff5387f1f65n & 0xbf2ed51ff75d380fd3be813ec6185780n === 0x42092803008e813400181700n");
+assert.sameValue(0n & -1n, 0n, "0n & -1n === 0n");
+assert.sameValue(-1n & 0n, 0n, "-1n & 0n === 0n");
+assert.sameValue(0n & -2n, 0n, "0n & -2n === 0n");
+assert.sameValue(-2n & 0n, 0n, "-2n & 0n === 0n");
+assert.sameValue(1n & -2n, 0n, "1n & -2n === 0n");
+assert.sameValue(-2n & 1n, 0n, "-2n & 1n === 0n");
+assert.sameValue(2n & -2n, 2n, "2n & -2n === 2n");
+assert.sameValue(-2n & 2n, 2n, "-2n & 2n === 2n");
+assert.sameValue(2n & -3n, 0n, "2n & -3n === 0n");
+assert.sameValue(-3n & 2n, 0n, "-3n & 2n === 0n");
+assert.sameValue(-1n & -2n, -2n, "-1n & -2n === -2n");
+assert.sameValue(-2n & -1n, -2n, "-2n & -1n === -2n");
+assert.sameValue(-2n & -2n, -2n, "-2n & -2n === -2n");
+assert.sameValue(-2n & -3n, -4n, "-2n & -3n === -4n");
+assert.sameValue(-3n & -2n, -4n, "-3n & -2n === -4n");
+assert.sameValue(0xffffffffn & -1n, 0xffffffffn, "0xffffffffn & -1n === 0xffffffffn");
+assert.sameValue(-1n & 0xffffffffn, 0xffffffffn, "-1n & 0xffffffffn === 0xffffffffn");
+assert.sameValue(0xffffffffffffffffn & -1n, 0xffffffffffffffffn, "0xffffffffffffffffn & -1n === 0xffffffffffffffffn");
+assert.sameValue(-1n & 0xffffffffffffffffn, 0xffffffffffffffffn, "-1n & 0xffffffffffffffffn === 0xffffffffffffffffn");
+assert.sameValue(
+  0xbf2ed51ff75d380fd3be813ec6185780n & -0x4aabef2324cedff5387f1f65n, 0xbf2ed51fb554100cd330000ac6004080n,
+  "0xbf2ed51ff75d380fd3be813ec6185780n & -0x4aabef2324cedff5387f1f65n === 0xbf2ed51fb554100cd330000ac6004080n");
+assert.sameValue(
+  -0x4aabef2324cedff5387f1f65n & 0xbf2ed51ff75d380fd3be813ec6185780n, 0xbf2ed51fb554100cd330000ac6004080n,
+  "-0x4aabef2324cedff5387f1f65n & 0xbf2ed51ff75d380fd3be813ec6185780n === 0xbf2ed51fb554100cd330000ac6004080n");
+assert.sameValue(
+  -0xbf2ed51ff75d380fd3be813ec6185780n & 0x4aabef2324cedff5387f1f65n, 0x8a2c72024405ec138670800n,
+  "-0xbf2ed51ff75d380fd3be813ec6185780n & 0x4aabef2324cedff5387f1f65n === 0x8a2c72024405ec138670800n");
+assert.sameValue(
+  0x4aabef2324cedff5387f1f65n & -0xbf2ed51ff75d380fd3be813ec6185780n, 0x8a2c72024405ec138670800n,
+  "0x4aabef2324cedff5387f1f65n & -0xbf2ed51ff75d380fd3be813ec6185780n === 0x8a2c72024405ec138670800n");
+assert.sameValue(
+  -0xbf2ed51ff75d380fd3be813ec6185780n & -0x4aabef2324cedff5387f1f65n, -0xbf2ed51fffffff2ff7fedffffe7f5f80n,
+  "-0xbf2ed51ff75d380fd3be813ec6185780n & -0x4aabef2324cedff5387f1f65n === -0xbf2ed51fffffff2ff7fedffffe7f5f80n");
+assert.sameValue(
+  -0x4aabef2324cedff5387f1f65n & -0xbf2ed51ff75d380fd3be813ec6185780n, -0xbf2ed51fffffff2ff7fedffffe7f5f80n,
+  "-0x4aabef2324cedff5387f1f65n & -0xbf2ed51ff75d380fd3be813ec6185780n === -0xbf2ed51fffffff2ff7fedffffe7f5f80n");
+assert.sameValue(-0xffffffffn & 0n, 0n, "-0xffffffffn & 0n === 0n");
+assert.sameValue(0n & -0xffffffffn, 0n, "0n & -0xffffffffn === 0n");
+assert.sameValue(
+  -0xffffffffffffffffn & 0x10000000000000000n, 0x10000000000000000n,
+  "-0xffffffffffffffffn & 0x10000000000000000n === 0x10000000000000000n");
+assert.sameValue(
+  0x10000000000000000n & -0xffffffffffffffffn, 0x10000000000000000n,
+  "0x10000000000000000n & -0xffffffffffffffffn === 0x10000000000000000n");
+assert.sameValue(
+  -0xffffffffffffffffffffffffn & 0x10000000000000000n, 0n,
+  "-0xffffffffffffffffffffffffn & 0x10000000000000000n === 0n");
+assert.sameValue(
+  0x10000000000000000n & -0xffffffffffffffffffffffffn, 0n,
+  "0x10000000000000000n & -0xffffffffffffffffffffffffn === 0n");
--- a/test/language/expressions/bitwise-or/bigint-non-primitive.js
+++ b/test/language/expressions/bitwise-or/bigint-non-primitive.js
@ -0,0 +1,44 @@
+// Copyright (C) 2017 Josh Wolfe. All rights reserved.
+// This code is governed by the BSD license found in the LICENSE file.
+
+/*---
+description: Bitwise OR for BigInt non-primitive values
+esid: sec-binary-bitwise-operators-runtime-semantics-evaluation
+info: |
+
+  5. Let lnum be ? ToNumeric(lval).
+  6. Let rnum be ? ToNumeric(rval).
+  ...
+  8. Let T be Type(lnum).
+  ...
+  10. If @ is |, return T::bitwiseOR(lnum, rnum).
+
+features: [BigInt]
+---*/
+
+assert.sameValue(Object(5n) | 3n, 7n, "Object(5n) | 3n === 7n");
+assert.sameValue(3n | Object(5n), 7n, "3n | Object(5n) === 7n");
+assert.sameValue(Object(5n) | Object(3n), 7n, "Object(5n) | Object(3n) === 7n");
+
+function err() {
+  throw new Test262Error();
+}
+
+assert.sameValue(
+  {[Symbol.toPrimitive]: function() { return 5n; }, valueOf: err, toString: err} | 3n, 7n,
+  "primitive from @@toPrimitive");
+assert.sameValue(
+  3n | {[Symbol.toPrimitive]: function() { return 5n; }, valueOf: err, toString: err}, 7n,
+  "primitive from @@toPrimitive");
+assert.sameValue(
+  {valueOf: function() { return 5n; }, toString: err} | 3n, 7n,
+  "primitive from {}.valueOf");
+assert.sameValue(
+  3n | {valueOf: function() { return 5n; }, toString: err}, 7n,
+  "primitive from {}.valueOf");
+assert.sameValue(
+  {toString: function() { return 5n; }} | 3n, 7n,
+  "primitive from {}.toString");
+assert.sameValue(
+  3n | {toString: function() { return 5n; }}, 7n,
+  "primitive from {}.toString");
--- a/test/language/expressions/bitwise-or/bigint.js
+++ b/test/language/expressions/bitwise-or/bigint.js
@ -0,0 +1,107 @@
+// Copyright (C) 2017 Josh Wolfe. All rights reserved.
+// This code is governed by the BSD license found in the LICENSE file.
+
+/*---
+description: Bitwise OR for BigInt values
+esid: sec-bitwise-op
+info: |
+  BitwiseOp(op, x, y)
+
+  1. Let result be 0.
+  2. Let shift be 0.
+  3. Repeat, until (x = 0 or x = -1) and (y = 0 or y = -1),
+    a. Let xDigit be x modulo 2.
+    b. Let yDigit be y modulo 2.
+    c. Let result be result + 2**shift * op(xDigit, yDigit)
+    d. Let shift be shift + 1.
+    e. Let x be (x - xDigit) / 2.
+    f. Let y be (y - yDigit) / 2.
+  4. If op(x modulo 2, y modulo 2) ≠ 0,
+    a. Let result be result - 2**shift. NOTE: This extends the sign.
+  5. Return result.
+
+features: [BigInt]
+---*/
+
+assert.sameValue(0n | 0n, 0n, "0n | 0n === 0n");
+assert.sameValue(0n | 1n, 1n, "0n | 1n === 1n");
+assert.sameValue(1n | 0n, 1n, "1n | 0n === 1n");
+assert.sameValue(0n | 2n, 2n, "0n | 2n === 2n");
+assert.sameValue(2n | 0n, 2n, "2n | 0n === 2n");
+assert.sameValue(0n | 3n, 3n, "0n | 3n === 3n");
+assert.sameValue(3n | 0n, 3n, "3n | 0n === 3n");
+assert.sameValue(1n | 1n, 1n, "1n | 1n === 1n");
+assert.sameValue(1n | 2n, 3n, "1n | 2n === 3n");
+assert.sameValue(2n | 1n, 3n, "2n | 1n === 3n");
+assert.sameValue(1n | 3n, 3n, "1n | 3n === 3n");
+assert.sameValue(3n | 1n, 3n, "3n | 1n === 3n");
+assert.sameValue(2n | 2n, 2n, "2n | 2n === 2n");
+assert.sameValue(2n | 3n, 3n, "2n | 3n === 3n");
+assert.sameValue(3n | 2n, 3n, "3n | 2n === 3n");
+assert.sameValue(0xffffffffn | 0n, 0xffffffffn, "0xffffffffn | 0n === 0xffffffffn");
+assert.sameValue(0n | 0xffffffffn, 0xffffffffn, "0n | 0xffffffffn === 0xffffffffn");
+assert.sameValue(0xffffffffn | 0xffffffffn, 0xffffffffn, "0xffffffffn | 0xffffffffn === 0xffffffffn");
+assert.sameValue(0xffffffffffffffffn | 0n, 0xffffffffffffffffn, "0xffffffffffffffffn | 0n === 0xffffffffffffffffn");
+assert.sameValue(0n | 0xffffffffffffffffn, 0xffffffffffffffffn, "0n | 0xffffffffffffffffn === 0xffffffffffffffffn");
+assert.sameValue(0xffffffffffffffffn | 0xffffffffn, 0xffffffffffffffffn, "0xffffffffffffffffn | 0xffffffffn === 0xffffffffffffffffn");
+assert.sameValue(0xffffffffn | 0xffffffffffffffffn, 0xffffffffffffffffn, "0xffffffffn | 0xffffffffffffffffn === 0xffffffffffffffffn");
+assert.sameValue(
+  0xffffffffffffffffn | 0xffffffffffffffffn, 0xffffffffffffffffn,
+  "0xffffffffffffffffn | 0xffffffffffffffffn === 0xffffffffffffffffn");
+assert.sameValue(
+  0xbf2ed51ff75d380fd3be813ec6185780n | 0x4aabef2324cedff5387f1f65n, 0xbf2ed51fffffff2ff7fedffffe7f5fe5n,
+  "0xbf2ed51ff75d380fd3be813ec6185780n | 0x4aabef2324cedff5387f1f65n === 0xbf2ed51fffffff2ff7fedffffe7f5fe5n");
+assert.sameValue(
+  0x4aabef2324cedff5387f1f65n | 0xbf2ed51ff75d380fd3be813ec6185780n, 0xbf2ed51fffffff2ff7fedffffe7f5fe5n,
+  "0x4aabef2324cedff5387f1f65n | 0xbf2ed51ff75d380fd3be813ec6185780n === 0xbf2ed51fffffff2ff7fedffffe7f5fe5n");
+assert.sameValue(0n | -1n, -1n, "0n | -1n === -1n");
+assert.sameValue(-1n | 0n, -1n, "-1n | 0n === -1n");
+assert.sameValue(0n | -2n, -2n, "0n | -2n === -2n");
+assert.sameValue(-2n | 0n, -2n, "-2n | 0n === -2n");
+assert.sameValue(1n | -2n, -1n, "1n | -2n === -1n");
+assert.sameValue(-2n | 1n, -1n, "-2n | 1n === -1n");
+assert.sameValue(2n | -2n, -2n, "2n | -2n === -2n");
+assert.sameValue(-2n | 2n, -2n, "-2n | 2n === -2n");
+assert.sameValue(2n | -3n, -1n, "2n | -3n === -1n");
+assert.sameValue(-3n | 2n, -1n, "-3n | 2n === -1n");
+assert.sameValue(-1n | -2n, -1n, "-1n | -2n === -1n");
+assert.sameValue(-2n | -1n, -1n, "-2n | -1n === -1n");
+assert.sameValue(-2n | -2n, -2n, "-2n | -2n === -2n");
+assert.sameValue(-2n | -3n, -1n, "-2n | -3n === -1n");
+assert.sameValue(-3n | -2n, -1n, "-3n | -2n === -1n");
+assert.sameValue(0xffffffffn | -1n, -1n, "0xffffffffn | -1n === -1n");
+assert.sameValue(-1n | 0xffffffffn, -1n, "-1n | 0xffffffffn === -1n");
+assert.sameValue(0xffffffffffffffffn | -1n, -1n, "0xffffffffffffffffn | -1n === -1n");
+assert.sameValue(-1n | 0xffffffffffffffffn, -1n, "-1n | 0xffffffffffffffffn === -1n");
+assert.sameValue(
+  0xbf2ed51ff75d380fd3be813ec6185780n | -0x4aabef2324cedff5387f1f65n, -0x8a2c72024405ec138670865n,
+  "0xbf2ed51ff75d380fd3be813ec6185780n | -0x4aabef2324cedff5387f1f65n === -0x8a2c72024405ec138670865n");
+assert.sameValue(
+  -0x4aabef2324cedff5387f1f65n | 0xbf2ed51ff75d380fd3be813ec6185780n, -0x8a2c72024405ec138670865n,
+  "-0x4aabef2324cedff5387f1f65n | 0xbf2ed51ff75d380fd3be813ec6185780n === -0x8a2c72024405ec138670865n");
+assert.sameValue(
+  -0xbf2ed51ff75d380fd3be813ec6185780n | 0x4aabef2324cedff5387f1f65n, -0xbf2ed51fb554100cd330000ac600401bn,
+  "-0xbf2ed51ff75d380fd3be813ec6185780n | 0x4aabef2324cedff5387f1f65n === -0xbf2ed51fb554100cd330000ac600401bn");
+assert.sameValue(
+  0x4aabef2324cedff5387f1f65n | -0xbf2ed51ff75d380fd3be813ec6185780n, -0xbf2ed51fb554100cd330000ac600401bn,
+  "0x4aabef2324cedff5387f1f65n | -0xbf2ed51ff75d380fd3be813ec6185780n === -0xbf2ed51fb554100cd330000ac600401bn");
+assert.sameValue(
+  -0xbf2ed51ff75d380fd3be813ec6185780n | -0x4aabef2324cedff5387f1f65n, -0x42092803008e813400181765n,
+  "-0xbf2ed51ff75d380fd3be813ec6185780n | -0x4aabef2324cedff5387f1f65n === -0x42092803008e813400181765n");
+assert.sameValue(
+  -0x4aabef2324cedff5387f1f65n | -0xbf2ed51ff75d380fd3be813ec6185780n, -0x42092803008e813400181765n,
+  "-0x4aabef2324cedff5387f1f65n | -0xbf2ed51ff75d380fd3be813ec6185780n === -0x42092803008e813400181765n");
+assert.sameValue(-0xffffffffn | 0n, -0xffffffffn, "-0xffffffffn | 0n === -0xffffffffn");
+assert.sameValue(0n | -0xffffffffn, -0xffffffffn, "0n | -0xffffffffn === -0xffffffffn");
+assert.sameValue(
+  -0xffffffffffffffffn | 0x10000000000000000n, -0xffffffffffffffffn,
+  "-0xffffffffffffffffn | 0x10000000000000000n === -0xffffffffffffffffn");
+assert.sameValue(
+  0x10000000000000000n | -0xffffffffffffffffn, -0xffffffffffffffffn,
+  "0x10000000000000000n | -0xffffffffffffffffn === -0xffffffffffffffffn");
+assert.sameValue(
+  -0xffffffffffffffffffffffffn | 0x10000000000000000n, -0xfffffffeffffffffffffffffn,
+  "-0xffffffffffffffffffffffffn | 0x10000000000000000n === -0xfffffffeffffffffffffffffn");
+assert.sameValue(
+  0x10000000000000000n | -0xffffffffffffffffffffffffn, -0xfffffffeffffffffffffffffn,
+  "0x10000000000000000n | -0xffffffffffffffffffffffffn === -0xfffffffeffffffffffffffffn");
--- a/test/language/expressions/bitwise-xor/bigint-non-primitive.js
+++ b/test/language/expressions/bitwise-xor/bigint-non-primitive.js
@ -0,0 +1,44 @@
+// Copyright (C) 2017 Josh Wolfe. All rights reserved.
+// This code is governed by the BSD license found in the LICENSE file.
+
+/*---
+description: Bitwise XOR for BigInt non-primitive values
+esid: sec-binary-bitwise-operators-runtime-semantics-evaluation
+info: |
+
+  5. Let lnum be ? ToNumeric(lval).
+  6. Let rnum be ? ToNumeric(rval).
+  ...
+  8. Let T be Type(lnum).
+  ...
+  11. Otherwise, @ is ^; return T::bitwiseXOR(lnum, rnum).
+
+features: [BigInt]
+---*/
+
+assert.sameValue(Object(5n) ^ 3n, 6n, "Object(5n) ^ 3n === 6n");
+assert.sameValue(3n ^ Object(5n), 6n, "3n ^ Object(5n) === 6n");
+assert.sameValue(Object(5n) ^ Object(3n), 6n, "Object(5n) ^ Object(3n) === 6n");
+
+function err() {
+  throw new Test262Error();
+}
+
+assert.sameValue(
+  {[Symbol.toPrimitive]: function() { return 5n; }, valueOf: err, toString: err} ^ 3n, 6n,
+  "primitive from @@toPrimitive");
+assert.sameValue(
+  3n ^ {[Symbol.toPrimitive]: function() { return 5n; }, valueOf: err, toString: err}, 6n,
+  "primitive from @@toPrimitive");
+assert.sameValue(
+  {valueOf: function() { return 5n; }, toString: err} ^ 3n, 6n,
+  "primitive from {}.valueOf");
+assert.sameValue(
+  3n ^ {valueOf: function() { return 5n; }, toString: err}, 6n,
+  "primitive from {}.valueOf");
+assert.sameValue(
+  {toString: function() { return 5n; }} ^ 3n, 6n,
+  "primitive from {}.toString");
+assert.sameValue(
+  3n ^ {toString: function() { return 5n; }}, 6n,
+  "primitive from {}.toString");
--- a/test/language/expressions/bitwise-xor/bigint.js
+++ b/test/language/expressions/bitwise-xor/bigint.js
@ -0,0 +1,107 @@
+// Copyright (C) 2017 Josh Wolfe. All rights reserved.
+// This code is governed by the BSD license found in the LICENSE file.
+
+/*---
+description: Bitwise XOR for BigInt values
+esid: sec-bitwise-op
+info: |
+  BitwiseOp(op, x, y)
+
+  1. Let result be 0.
+  2. Let shift be 0.
+  3. Repeat, until (x = 0 or x = -1) and (y = 0 or y = -1),
+    a. Let xDigit be x modulo 2.
+    b. Let yDigit be y modulo 2.
+    c. Let result be result + 2**shift * op(xDigit, yDigit)
+    d. Let shift be shift + 1.
+    e. Let x be (x - xDigit) / 2.
+    f. Let y be (y - yDigit) / 2.
+  4. If op(x modulo 2, y modulo 2) ≠ 0,
+    a. Let result be result - 2**shift. NOTE: This extends the sign.
+  5. Return result.
+
+features: [BigInt]
+---*/
+
+assert.sameValue(0n ^ 0n, 0n, "0n ^ 0n === 0n");
+assert.sameValue(0n ^ 1n, 1n, "0n ^ 1n === 1n");
+assert.sameValue(1n ^ 0n, 1n, "1n ^ 0n === 1n");
+assert.sameValue(0n ^ 2n, 2n, "0n ^ 2n === 2n");
+assert.sameValue(2n ^ 0n, 2n, "2n ^ 0n === 2n");
+assert.sameValue(0n ^ 3n, 3n, "0n ^ 3n === 3n");
+assert.sameValue(3n ^ 0n, 3n, "3n ^ 0n === 3n");
+assert.sameValue(1n ^ 1n, 0n, "1n ^ 1n === 0n");
+assert.sameValue(1n ^ 2n, 3n, "1n ^ 2n === 3n");
+assert.sameValue(2n ^ 1n, 3n, "2n ^ 1n === 3n");
+assert.sameValue(1n ^ 3n, 2n, "1n ^ 3n === 2n");
+assert.sameValue(3n ^ 1n, 2n, "3n ^ 1n === 2n");
+assert.sameValue(2n ^ 2n, 0n, "2n ^ 2n === 0n");
+assert.sameValue(2n ^ 3n, 1n, "2n ^ 3n === 1n");
+assert.sameValue(3n ^ 2n, 1n, "3n ^ 2n === 1n");
+assert.sameValue(0xffffffffn ^ 0n, 0xffffffffn, "0xffffffffn ^ 0n === 0xffffffffn");
+assert.sameValue(0n ^ 0xffffffffn, 0xffffffffn, "0n ^ 0xffffffffn === 0xffffffffn");
+assert.sameValue(0xffffffffn ^ 0xffffffffn, 0n, "0xffffffffn ^ 0xffffffffn === 0n");
+assert.sameValue(0xffffffffffffffffn ^ 0n, 0xffffffffffffffffn, "0xffffffffffffffffn ^ 0n === 0xffffffffffffffffn");
+assert.sameValue(0n ^ 0xffffffffffffffffn, 0xffffffffffffffffn, "0n ^ 0xffffffffffffffffn === 0xffffffffffffffffn");
+assert.sameValue(0xffffffffffffffffn ^ 0xffffffffn, 0xffffffff00000000n, "0xffffffffffffffffn ^ 0xffffffffn === 0xffffffff00000000n");
+assert.sameValue(0xffffffffn ^ 0xffffffffffffffffn, 0xffffffff00000000n, "0xffffffffn ^ 0xffffffffffffffffn === 0xffffffff00000000n");
+assert.sameValue(
+  0xffffffffffffffffn ^ 0xffffffffffffffffn, 0n,
+  "0xffffffffffffffffn ^ 0xffffffffffffffffn === 0n");
+assert.sameValue(
+  0xbf2ed51ff75d380fd3be813ec6185780n ^ 0x4aabef2324cedff5387f1f65n, 0xbf2ed51fbdf6d72cf7705ecbfe6748e5n,
+  "0xbf2ed51ff75d380fd3be813ec6185780n ^ 0x4aabef2324cedff5387f1f65n === 0xbf2ed51fbdf6d72cf7705ecbfe6748e5n");
+assert.sameValue(
+  0x4aabef2324cedff5387f1f65n ^ 0xbf2ed51ff75d380fd3be813ec6185780n, 0xbf2ed51fbdf6d72cf7705ecbfe6748e5n,
+  "0x4aabef2324cedff5387f1f65n ^ 0xbf2ed51ff75d380fd3be813ec6185780n === 0xbf2ed51fbdf6d72cf7705ecbfe6748e5n");
+assert.sameValue(0n ^ -1n, -1n, "0n ^ -1n === -1n");
+assert.sameValue(-1n ^ 0n, -1n, "-1n ^ 0n === -1n");
+assert.sameValue(0n ^ -2n, -2n, "0n ^ -2n === -2n");
+assert.sameValue(-2n ^ 0n, -2n, "-2n ^ 0n === -2n");
+assert.sameValue(1n ^ -2n, -1n, "1n ^ -2n === -1n");
+assert.sameValue(-2n ^ 1n, -1n, "-2n ^ 1n === -1n");
+assert.sameValue(2n ^ -2n, -4n, "2n ^ -2n === -4n");
+assert.sameValue(-2n ^ 2n, -4n, "-2n ^ 2n === -4n");
+assert.sameValue(2n ^ -3n, -1n, "2n ^ -3n === -1n");
+assert.sameValue(-3n ^ 2n, -1n, "-3n ^ 2n === -1n");
+assert.sameValue(-1n ^ -2n, 1n, "-1n ^ -2n === 1n");
+assert.sameValue(-2n ^ -1n, 1n, "-2n ^ -1n === 1n");
+assert.sameValue(-2n ^ -2n, 0n, "-2n ^ -2n === 0n");
+assert.sameValue(-2n ^ -3n, 3n, "-2n ^ -3n === 3n");
+assert.sameValue(-3n ^ -2n, 3n, "-3n ^ -2n === 3n");
+assert.sameValue(0xffffffffn ^ -1n, -0x100000000n, "0xffffffffn ^ -1n === -0x100000000n");
+assert.sameValue(-1n ^ 0xffffffffn, -0x100000000n, "-1n ^ 0xffffffffn === -0x100000000n");
+assert.sameValue(0xffffffffffffffffn ^ -1n, -0x10000000000000000n, "0xffffffffffffffffn ^ -1n === -0x10000000000000000n");
+assert.sameValue(-1n ^ 0xffffffffffffffffn, -0x10000000000000000n, "-1n ^ 0xffffffffffffffffn === -0x10000000000000000n");
+assert.sameValue(
+  0xbf2ed51ff75d380fd3be813ec6185780n ^ -0x4aabef2324cedff5387f1f65n, -0xbf2ed51fbdf6d72cf7705ecbfe6748e5n,
+  "0xbf2ed51ff75d380fd3be813ec6185780n ^ -0x4aabef2324cedff5387f1f65n === -0xbf2ed51fbdf6d72cf7705ecbfe6748e5n");
+assert.sameValue(
+  -0x4aabef2324cedff5387f1f65n ^ 0xbf2ed51ff75d380fd3be813ec6185780n, -0xbf2ed51fbdf6d72cf7705ecbfe6748e5n,
+  "-0x4aabef2324cedff5387f1f65n ^ 0xbf2ed51ff75d380fd3be813ec6185780n === -0xbf2ed51fbdf6d72cf7705ecbfe6748e5n");
+assert.sameValue(
+  -0xbf2ed51ff75d380fd3be813ec6185780n ^ 0x4aabef2324cedff5387f1f65n, -0xbf2ed51fbdf6d72cf7705ecbfe67481bn,
+  "-0xbf2ed51ff75d380fd3be813ec6185780n ^ 0x4aabef2324cedff5387f1f65n === -0xbf2ed51fbdf6d72cf7705ecbfe67481bn");
+assert.sameValue(
+  0x4aabef2324cedff5387f1f65n ^ -0xbf2ed51ff75d380fd3be813ec6185780n, -0xbf2ed51fbdf6d72cf7705ecbfe67481bn,
+  "0x4aabef2324cedff5387f1f65n ^ -0xbf2ed51ff75d380fd3be813ec6185780n === -0xbf2ed51fbdf6d72cf7705ecbfe67481bn");
+assert.sameValue(
+  -0xbf2ed51ff75d380fd3be813ec6185780n ^ -0x4aabef2324cedff5387f1f65n, 0xbf2ed51fbdf6d72cf7705ecbfe67481bn,
+  "-0xbf2ed51ff75d380fd3be813ec6185780n ^ -0x4aabef2324cedff5387f1f65n === 0xbf2ed51fbdf6d72cf7705ecbfe67481bn");
+assert.sameValue(
+  -0x4aabef2324cedff5387f1f65n ^ -0xbf2ed51ff75d380fd3be813ec6185780n, 0xbf2ed51fbdf6d72cf7705ecbfe67481bn,
+  "-0x4aabef2324cedff5387f1f65n ^ -0xbf2ed51ff75d380fd3be813ec6185780n === 0xbf2ed51fbdf6d72cf7705ecbfe67481bn");
+assert.sameValue(-0xffffffffn ^ 0n, -0xffffffffn, "-0xffffffffn ^ 0n === -0xffffffffn");
+assert.sameValue(0n ^ -0xffffffffn, -0xffffffffn, "0n ^ -0xffffffffn === -0xffffffffn");
+assert.sameValue(
+  -0xffffffffffffffffn ^ 0x10000000000000000n, -0x1ffffffffffffffffn,
+  "-0xffffffffffffffffn ^ 0x10000000000000000n === -0x1ffffffffffffffffn");
+assert.sameValue(
+  0x10000000000000000n ^ -0xffffffffffffffffn, -0x1ffffffffffffffffn,
+  "0x10000000000000000n ^ -0xffffffffffffffffn === -0x1ffffffffffffffffn");
+assert.sameValue(
+  -0xffffffffffffffffffffffffn ^ 0x10000000000000000n, -0xfffffffeffffffffffffffffn,
+  "-0xffffffffffffffffffffffffn ^ 0x10000000000000000n === -0xfffffffeffffffffffffffffn");
+assert.sameValue(
+  0x10000000000000000n ^ -0xffffffffffffffffffffffffn, -0xfffffffeffffffffffffffffn,
+  "0x10000000000000000n ^ -0xffffffffffffffffffffffffn === -0xfffffffeffffffffffffffffn");