Lines Matching refs:Array
677 TYPE_CHECKER(Fixed##Type##Array, FIXED_##TYPE##_ARRAY_TYPE)
754 // Must be a fixed array.
757 // There's no sure way to detect the difference between a fixed array and
758 // a deoptimization data array. Since this is used for asserts we can
771 // There's actually no way to see the difference between a fixed array and
772 // a deoptimization data array. Since this is used for asserts we can check
781 // There's actually no way to see the difference between a fixed array and
782 // a handler table array.
789 // There's actually no way to see the difference between a fixed array and
790 // a dependent codes array.
1622 Object* array = READ_FIELD(this, kElementsOffset);
1623 return static_cast<FixedArrayBase*>(array);
1687 // for a constructed array. Otherwise, it must be a boilerplate
1688 // for an object or array literal.
2197 // properties stored in the properties array.
2368 Handle<Object> FixedArray::get(Handle<FixedArray> array, int index) {
2369 return handle(array->get(index), array->GetIsolate());
2415 Handle<Object> FixedDoubleArray::get(Handle<FixedDoubleArray> array,
2417 if (array->is_the_hole(index)) {
2418 return array->GetIsolate()->factory()->the_hole_value();
2420 return array->GetIsolate()->factory()->NewNumber(array->get_scalar(index));
2578 void FixedArray::NoWriteBarrierSet(FixedArray* array,
2581 DCHECK(array->map() != array->GetHeap()->fixed_cow_array_map());
2582 DCHECK(index >= 0 && index < array->length());
2583 DCHECK(!array->GetHeap()->InNewSpace(value));
2584 WRITE_FIELD(array, kHeaderSize + index * kPointerSize, value);
2675 void DescriptorArray::CopyEnumCacheFrom(DescriptorArray* array) {
2676 set(kEnumCacheIndex, array->get(kEnumCacheIndex));
2710 // Perform a binary search in a fixed array. Low and high are entry indices. If
2711 // there are three entries in this array it should be called with low=0 and
2714 int BinarySearch(T* array, Name* name, int low, int high, int valid_entries,
2724 Name* mid_name = array->GetSortedKey(mid);
2735 int sort_index = array->GetSortedKeyIndex(low);
2736 Name* entry = array->GetKey(sort_index);
2757 // Perform a linear search in this fixed array. len is the number of entry
2760 int LinearSearch(T* array, Name* name, int len, int valid_entries,
2765 int sorted_index = array->GetSortedKeyIndex(number);
2766 Name* entry = array->GetKey(sorted_index);
2780 Name* entry = array->GetKey(number);
2790 int Search(T* array, Name* name, int valid_entries, int* out_insertion_index) {
2792 SLOW_DCHECK(array->IsSortedNoDuplicates(valid_entries));
2794 SLOW_DCHECK(array->IsSortedNoDuplicates());
2797 int nof = array->number_of_entries();
2809 return LinearSearch<search_mode>(array, name, nof, valid_entries,
2814 return BinarySearch<search_mode>(array, name, 0, nof - 1, valid_entries,
4225 Handle<FixedTypedArray<Traits> > array,
4227 return Traits::ToHandle(array->GetIsolate(), array->get_scalar(index));
6725 HeapObject* array = elements();
6726 DCHECK(array != NULL);
6727 return array->IsFixedTypedArrayBase();
6733 HeapObject* array = elements(); \
6734 DCHECK(array != NULL); \
6735 if (!array->IsHeapObject()) \
6737 return array->map()->instance_type() == FIXED_##TYPE##_ARRAY_TYPE; \
7537 // If the new array won't fit in a some non-trivial fraction of the max old
7552 void JSArray::SetContent(Handle<JSArray> array,
7554 EnsureCanContainElements(array, storage, storage->length(),
7557 DCHECK((storage->map() == array->GetHeap()->fixed_double_array_map() &&
7558 IsFastDoubleElementsKind(array->GetElementsKind())) ||
7559 ((storage->map() != array->GetHeap()->fixed_double_array_map()) &&
7560 (IsFastObjectElementsKind(array->GetElementsKind()) ||
7561 (IsFastSmiElementsKind(array->GetElementsKind()) &&
7563 array->set_elements(*storage);
7564 array->set_length(Smi::FromInt(storage->length()));
7689 array) {
7690 array->set(0, CurrentKey());
7694 void JSMapIterator::PopulateValueArray(FixedArray* array) {
7695 array->set(0, CurrentKey());
7696 array->set(1, CurrentValue());
