1 files changed, 47 insertions, 0 deletions
diff --git a/js/src/tests/test262/built-ins/TypedArray/prototype/findIndex/predicate-may-detach-buffer.js b/js/src/tests/test262/built-ins/TypedArray/prototype/findIndex/predicate-may-detach-buffer.js
new file mode 100644
index 0000000000..a86b1b06b0
--- /dev/null
+++ b/js/src/tests/test262/built-ins/TypedArray/prototype/findIndex/predicate-may-detach-buffer.js
@@ -0,0 +1,47 @@
+// Copyright (C) 2016 the V8 project authors. All rights reserved.
+// This code is governed by the BSD license found in the LICENSE file.
+/*---
+esid: sec-%typedarray%.prototype.findindex
+description: >
+  Predicate may detach the buffer
+info: |
+  22.2.3.11 %TypedArray%.prototype.findIndex ( predicate [ , thisArg ] )
+
+    %TypedArray%.prototype.findIndex is a distinct function that implements the
+    same algorithm as Array.prototype.findIndex as defined in 22.1.3.9 except that
+    the this object's [[ArrayLength]] internal slot is accessed in place of
+    performing a [[Get]] of "length".
+
+    ...
+
+  22.1.3.9 Array.prototype.findIndex ( predicate[ , thisArg ] )
+
+    Repeat, while k < len,
+      Let Pk be ! ToString(F(k)).
+      Let kValue be ? Get(O, Pk).
+      Let testResult be ! ToBoolean(? Call(predicate, thisArg, « kValue, F(k), O »)).
+    ...
+
+  IntegerIndexedElementGet ( O, index )
+
+    Let buffer be the value of O's [[ViewedArrayBuffer]] internal slot.
+    If IsDetachedBuffer(buffer) is true, return undefined.
+
+includes: [testTypedArray.js, detachArrayBuffer.js]
+features: [TypedArray]
+---*/
+
+testWithTypedArrayConstructors(function(TA) {
+  var sample = new TA(2);
+  var loops = 0;
+
+  sample.findIndex(function() {
+    if (loops === 0) {
+      $DETACHBUFFER(sample.buffer);
+    }
+    loops++;
+  });
+  assert.sameValue(loops, 2, "predicate is called once");
+});
+
+reportCompare(0, 0);