runtime-typedarray.cc 12.1 KB
Newer Older
1 2 3 4
// Copyright 2014 the V8 project authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.

5
#include "src/runtime/runtime-utils.h"
6 7

#include "src/arguments.h"
8
#include "src/elements.h"
9
#include "src/factory.h"
10
#include "src/messages.h"
11
#include "src/objects-inl.h"
12 13 14 15 16 17 18
#include "src/runtime/runtime.h"

namespace v8 {
namespace internal {

RUNTIME_FUNCTION(Runtime_ArrayBufferGetByteLength) {
  SealHandleScope shs(isolate);
19
  DCHECK_EQ(1, args.length());
20 21 22 23 24 25 26
  CONVERT_ARG_CHECKED(JSArrayBuffer, holder, 0);
  return holder->byte_length();
}


RUNTIME_FUNCTION(Runtime_ArrayBufferNeuter) {
  HandleScope scope(isolate);
27
  DCHECK_EQ(1, args.length());
28 29 30 31 32 33 34 35
  Handle<Object> argument = args.at(0);
  // This runtime function is exposed in ClusterFuzz and as such has to
  // support arbitrary arguments.
  if (!argument->IsJSArrayBuffer()) {
    THROW_NEW_ERROR_RETURN_FAILURE(
        isolate, NewTypeError(MessageTemplate::kNotTypedArray));
  }
  Handle<JSArrayBuffer> array_buffer = Handle<JSArrayBuffer>::cast(argument);
36 37 38
  if (!array_buffer->is_neuterable()) {
    return isolate->heap()->undefined_value();
  }
39
  if (array_buffer->backing_store() == nullptr) {
40
    CHECK_EQ(Smi::kZero, array_buffer->byte_length());
41 42
    return isolate->heap()->undefined_value();
  }
binji's avatar
binji committed
43
  // Shared array buffers should never be neutered.
44
  CHECK(!array_buffer->is_shared());
45 46
  DCHECK(!array_buffer->is_external());
  void* backing_store = array_buffer->backing_store();
47
  size_t byte_length = NumberToSize(array_buffer->byte_length());
48
  array_buffer->set_is_external(true);
49
  isolate->heap()->UnregisterArrayBuffer(*array_buffer);
50
  array_buffer->Neuter();
51
  isolate->array_buffer_allocator()->Free(backing_store, byte_length);
52 53 54
  return isolate->heap()->undefined_value();
}

55 56 57
RUNTIME_FUNCTION(Runtime_TypedArrayCopyElements) {
  HandleScope scope(isolate);
  DCHECK_EQ(3, args.length());
58
  CONVERT_ARG_HANDLE_CHECKED(JSTypedArray, target, 0);
59 60 61
  CONVERT_ARG_HANDLE_CHECKED(JSReceiver, source, 1);
  CONVERT_NUMBER_ARG_HANDLE_CHECKED(length_obj, 2);

62 63 64 65 66
  size_t length;
  CHECK(TryNumberToSize(*length_obj, &length));

  ElementsAccessor* accessor = target->GetElementsAccessor();
  return accessor->CopyElements(source, target, length);
67 68
}

69 70 71
#define BUFFER_VIEW_GETTER(Type, getter, accessor)   \
  RUNTIME_FUNCTION(Runtime_##Type##Get##getter) {    \
    HandleScope scope(isolate);                      \
72
    DCHECK_EQ(1, args.length());                     \
73 74 75 76 77 78 79 80 81 82
    CONVERT_ARG_HANDLE_CHECKED(JS##Type, holder, 0); \
    return holder->accessor();                       \
  }

BUFFER_VIEW_GETTER(ArrayBufferView, ByteLength, byte_length)
BUFFER_VIEW_GETTER(ArrayBufferView, ByteOffset, byte_offset)
BUFFER_VIEW_GETTER(TypedArray, Length, length)

#undef BUFFER_VIEW_GETTER

83 84 85 86 87 88
RUNTIME_FUNCTION(Runtime_ArrayBufferViewWasNeutered) {
  HandleScope scope(isolate);
  DCHECK_EQ(1, args.length());
  return isolate->heap()->ToBoolean(JSTypedArray::cast(args[0])->WasNeutered());
}

89 90
RUNTIME_FUNCTION(Runtime_TypedArrayGetBuffer) {
  HandleScope scope(isolate);
91
  DCHECK_EQ(1, args.length());
92 93 94 95
  CONVERT_ARG_HANDLE_CHECKED(JSTypedArray, holder, 0);
  return *holder->GetBuffer();
}

96

97 98
namespace {

99 100 101 102 103 104 105 106 107 108 109 110 111 112 113
template <typename T>
bool CompareNum(T x, T y) {
  if (x < y) {
    return true;
  } else if (x > y) {
    return false;
  } else if (!std::is_integral<T>::value) {
    double _x = x, _y = y;
    if (x == 0 && x == y) {
      /* -0.0 is less than +0.0 */
      return std::signbit(_x) && !std::signbit(_y);
    } else if (!std::isnan(_x) && std::isnan(_y)) {
      /* number is less than NaN */
      return true;
    }
114
  }
115 116
  return false;
}
117 118 119 120 121 122 123 124 125 126 127 128 129 130

}  // namespace

RUNTIME_FUNCTION(Runtime_TypedArraySortFast) {
  HandleScope scope(isolate);
  DCHECK_EQ(1, args.length());

  CONVERT_ARG_HANDLE_CHECKED(Object, target_obj, 0);

  Handle<JSTypedArray> array;
  const char* method = "%TypedArray%.prototype.sort";
  ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
      isolate, array, JSTypedArray::Validate(isolate, target_obj, method));

131
  // This line can be removed when JSTypedArray::Validate throws
132 133 134 135
  // if array.[[ViewedArrayBuffer]] is neutered(v8:4648)
  if (V8_UNLIKELY(array->WasNeutered())) return *array;

  size_t length = array->length_value();
136
  if (length <= 1) return *array;
137

138 139
  Handle<FixedTypedArrayBase> elements(
      FixedTypedArrayBase::cast(array->elements()));
140
  switch (array->type()) {
141 142 143 144 145 146 147 148 149
#define TYPED_ARRAY_SORT(Type, type, TYPE, ctype, size)     \
  case kExternal##Type##Array: {                            \
    ctype* data = static_cast<ctype*>(elements->DataPtr()); \
    if (kExternal##Type##Array == kExternalFloat64Array ||  \
        kExternal##Type##Array == kExternalFloat32Array)    \
      std::sort(data, data + length, CompareNum<ctype>);    \
    else                                                    \
      std::sort(data, data + length);                       \
    break;                                                  \
150 151 152 153 154 155 156 157
  }

    TYPED_ARRAYS(TYPED_ARRAY_SORT)
#undef TYPED_ARRAY_SORT
  }

  return *array;
}
158

159 160
RUNTIME_FUNCTION(Runtime_IsTypedArray) {
  HandleScope scope(isolate);
161
  DCHECK_EQ(1, args.length());
162 163 164
  return isolate->heap()->ToBoolean(args[0]->IsJSTypedArray());
}

binji's avatar
binji committed
165 166
RUNTIME_FUNCTION(Runtime_IsSharedTypedArray) {
  HandleScope scope(isolate);
167
  DCHECK_EQ(1, args.length());
binji's avatar
binji committed
168 169 170 171 172 173 174 175
  return isolate->heap()->ToBoolean(
      args[0]->IsJSTypedArray() &&
      JSTypedArray::cast(args[0])->GetBuffer()->is_shared());
}


RUNTIME_FUNCTION(Runtime_IsSharedIntegerTypedArray) {
  HandleScope scope(isolate);
176
  DCHECK_EQ(1, args.length());
binji's avatar
binji committed
177 178 179 180 181 182 183
  if (!args[0]->IsJSTypedArray()) {
    return isolate->heap()->false_value();
  }

  Handle<JSTypedArray> obj(JSTypedArray::cast(args[0]));
  return isolate->heap()->ToBoolean(obj->GetBuffer()->is_shared() &&
                                    obj->type() != kExternalFloat32Array &&
184 185
                                    obj->type() != kExternalFloat64Array &&
                                    obj->type() != kExternalUint8ClampedArray);
binji's avatar
binji committed
186 187 188
}


189 190
RUNTIME_FUNCTION(Runtime_IsSharedInteger32TypedArray) {
  HandleScope scope(isolate);
191
  DCHECK_EQ(1, args.length());
192 193 194 195 196 197 198 199 200
  if (!args[0]->IsJSTypedArray()) {
    return isolate->heap()->false_value();
  }

  Handle<JSTypedArray> obj(JSTypedArray::cast(args[0]));
  return isolate->heap()->ToBoolean(obj->GetBuffer()->is_shared() &&
                                    obj->type() == kExternalInt32Array);
}

201 202
RUNTIME_FUNCTION(Runtime_TypedArraySpeciesCreateByLength) {
  HandleScope scope(isolate);
203
  DCHECK_EQ(args.length(), 2);
204 205
  Handle<JSTypedArray> exemplar = args.at<JSTypedArray>(0);
  Handle<Object> length = args.at(1);
206 207 208 209 210 211 212 213 214 215 216
  int argc = 1;
  ScopedVector<Handle<Object>> argv(argc);
  argv[0] = length;
  Handle<JSTypedArray> result_array;
  // TODO(tebbi): Pass correct method name.
  ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
      isolate, result_array,
      JSTypedArray::SpeciesCreate(isolate, exemplar, argc, argv.start(), ""));
  return *result_array;
}

217 218
namespace {

219 220 221 222 223 224 225 226 227 228 229 230 231 232
Object* TypedArraySetFromOverlapping(Isolate* isolate,
                                     Handle<JSTypedArray> target,
                                     Handle<JSTypedArray> source,
                                     uint32_t offset) {
#ifdef DEBUG
  Handle<FixedTypedArrayBase> source_elements(
      FixedTypedArrayBase::cast(source->elements()));
  Handle<FixedTypedArrayBase> target_elements(
      FixedTypedArrayBase::cast(target->elements()));
  uint8_t* source_data = static_cast<uint8_t*>(source_elements->DataPtr());
  uint8_t* target_data = static_cast<uint8_t*>(target_elements->DataPtr());
  size_t source_byte_length = NumberToSize(source->byte_length());
  size_t target_byte_length = NumberToSize(target->byte_length());

233 234
  CHECK_LE(offset, target->length_value());
  CHECK_LE(source->length_value(), target->length_value() - offset);
235 236 237 238 239 240 241 242 243
  CHECK(source->length()->IsSmi());

  CHECK(!target->WasNeutered());
  CHECK(!source->WasNeutered());

  // Assert that target and source in fact overlapping.
  CHECK(target_data + target_byte_length > source_data &&
        source_data + source_byte_length > target_data);
#endif
244 245 246 247 248

  size_t sourceElementSize = source->element_size();
  size_t targetElementSize = target->element_size();

  uint32_t source_length = source->length_value();
249
  if (source_length == 0) return isolate->heap()->undefined_value();
250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306

  // Copy left part.

  // First un-mutated byte after the next write
  uint32_t target_ptr = 0;
  CHECK(target->byte_offset()->ToUint32(&target_ptr));
  target_ptr += (offset + 1) * targetElementSize;

  // Next read at sourcePtr. We do not care for memory changing before
  // sourcePtr - we have already copied it.
  uint32_t source_ptr = 0;
  CHECK(source->byte_offset()->ToUint32(&source_ptr));

  ElementsAccessor* source_accessor = source->GetElementsAccessor();
  ElementsAccessor* target_accessor = target->GetElementsAccessor();

  uint32_t left_index;
  for (left_index = 0; left_index < source_length && target_ptr <= source_ptr;
       left_index++) {
    Handle<Object> value = source_accessor->Get(source, left_index);
    target_accessor->Set(target, offset + left_index, *value);

    target_ptr += targetElementSize;
    source_ptr += sourceElementSize;
  }

  // Copy right part;
  // First unmutated byte before the next write
  CHECK(target->byte_offset()->ToUint32(&target_ptr));
  target_ptr += (offset + source_length - 1) * targetElementSize;

  // Next read before sourcePtr. We do not care for memory changing after
  // sourcePtr - we have already copied it.
  CHECK(target->byte_offset()->ToUint32(&source_ptr));
  source_ptr += source_length * sourceElementSize;

  uint32_t right_index;
  DCHECK_GE(source_length, 1);
  for (right_index = source_length - 1;
       right_index > left_index && target_ptr >= source_ptr; right_index--) {
    Handle<Object> value = source_accessor->Get(source, right_index);
    target_accessor->Set(target, offset + right_index, *value);

    target_ptr -= targetElementSize;
    source_ptr -= sourceElementSize;
  }

  std::vector<Handle<Object>> temp(right_index + 1 - left_index);

  for (uint32_t i = left_index; i <= right_index; i++) {
    temp[i - left_index] = source_accessor->Get(source, i);
  }

  for (uint32_t i = left_index; i <= right_index; i++) {
    target_accessor->Set(target, offset + i, *temp[i - left_index]);
  }

307
  return isolate->heap()->undefined_value();
308 309
}

310
}  // namespace
311

312
// 22.2.3.23 %TypedArray%.prototype.set ( overloaded [ , offset ] )
313 314 315 316 317 318 319
RUNTIME_FUNCTION(Runtime_TypedArraySet) {
  HandleScope scope(isolate);
  Handle<JSTypedArray> target = args.at<JSTypedArray>(0);
  Handle<Object> obj = args.at(1);
  Handle<Smi> offset = args.at<Smi>(2);

  DCHECK(!target->WasNeutered());  // Checked in TypedArrayPrototypeSet.
320
  DCHECK_LE(0, offset->value());
321 322 323

  const uint32_t uint_offset = static_cast<uint32_t>(offset->value());

324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340
  if (obj->IsNumber()) {
    // For number as a first argument, throw TypeError
    // instead of silently ignoring the call, so that
    // users know they did something wrong.
    // (Consistent with Firefox and Blink/WebKit)
    THROW_NEW_ERROR_RETURN_FAILURE(
        isolate, NewTypeError(MessageTemplate::kInvalidArgument));
  } else if (obj->IsJSTypedArray()) {
    // The non-overlapping case is handled in CSA.
    Handle<JSTypedArray> source = Handle<JSTypedArray>::cast(obj);
    return TypedArraySetFromOverlapping(isolate, target, source, uint_offset);
  }

  ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, obj,
                                     Object::ToObject(isolate, obj));

  Handle<Object> len;
341
  ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
342 343 344 345 346 347 348 349
      isolate, len,
      Object::GetProperty(obj, isolate->factory()->length_string()));
  ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, len,
                                     Object::ToLength(isolate, len));

  if (uint_offset + len->Number() > target->length_value()) {
    THROW_NEW_ERROR_RETURN_FAILURE(
        isolate, NewRangeError(MessageTemplate::kTypedArraySetSourceTooLarge));
350 351
  }

352 353 354 355 356 357
  uint32_t int_l;
  CHECK(DoubleToUint32IfEqualToSelf(len->Number(), &int_l));

  Handle<JSReceiver> source = Handle<JSReceiver>::cast(obj);
  ElementsAccessor* accessor = target->GetElementsAccessor();
  return accessor->CopyElements(source, target, int_l, uint_offset);
358 359
}

360 361
}  // namespace internal
}  // namespace v8