Home
last modified time | relevance | path

Searched refs:number_of_elements (Results 1 - 25 of 33) sorted by relevance

12

/third_party/ffmpeg/tests/api/
H A Dapi-seek-test.c35 int number_of_elements; variable
39 if (size_of_array <= number_of_elements) { in add_crc_to_array()
50 crc_array[number_of_elements] = crc; in add_crc_to_array()
51 pts_array[number_of_elements] = pts; in add_crc_to_array()
52 number_of_elements++; in add_crc_to_array()
59 for (i = 0; i < number_of_elements; i++) { in compare_crc_in_array()
199 number_of_elements = 0; in seek_test()
/third_party/node/deps/v8/src/objects/
H A Dstring-table.cc34 bool StringTableHasSufficientCapacityToAdd(int capacity, int number_of_elements, in StringTableHasSufficientCapacityToAdd() argument
37 int nof = number_of_elements + number_of_additional_elements; in StringTableHasSufficientCapacityToAdd()
112 capacity(), number_of_elements(), number_of_deleted_elements(), 1)); in ElementAdded()
119 capacity(), number_of_elements(), number_of_deleted_elements() - 1, 1)); in DeletedElementOverwritten()
135 int number_of_elements() const { return number_of_elements_; } in number_of_elements() function in v8::internal::StringTable::Data
231 DCHECK_LT(data->number_of_elements(), new_data->capacity()); in Resize()
233 new_data->capacity(), new_data->number_of_elements(), in Resize()
234 new_data->number_of_deleted_elements(), data->number_of_elements())); in Resize()
246 new_data->number_of_elements_ = data->number_of_elements(); in Resize()
340 return data_.load(std::memory_order_relaxed)->number_of_elements(); in NumberOfElements()
[all...]
H A Dhash-table.h215 static bool HasSufficientCapacityToAdd(int capacity, int number_of_elements,
H A Delements.cc5168 int number_of_elements = args->length();
5169 JSObject::EnsureCanContainElements(array, args, number_of_elements,
5177 factory->NewFixedDoubleArray(number_of_elements));
5180 factory->NewFixedArrayWithHoles(number_of_elements));
5188 for (int entry = 0; entry < number_of_elements; entry++) {
5198 for (int entry = 0; entry < number_of_elements; entry++) {
5207 for (int entry = 0; entry < number_of_elements; entry++) {
5217 array->set_length(Smi::FromInt(number_of_elements));
/third_party/skia/third_party/externals/spirv-tools/source/opt/
H A Dreplace_desc_array_access_using_var_index.cpp81 uint32_t number_of_elements = in ReplaceAccessChain() local
83 assert(number_of_elements != 0 && "Number of element is 0"); in ReplaceAccessChain()
84 if (number_of_elements == 1) { in ReplaceAccessChain()
89 ReplaceUsersOfAccessChain(access_chain, number_of_elements); in ReplaceAccessChain()
93 Instruction* access_chain, uint32_t number_of_elements) const { in ReplaceUsersOfAccessChain()
100 inst, access_chain, number_of_elements, insts_to_be_cloned); in ReplaceUsersOfAccessChain()
254 uint32_t number_of_elements, in ReplaceNonUniformAccessWithSwitchCase()
266 for (uint32_t idx = 0; idx < number_of_elements; ++idx) { in ReplaceNonUniformAccessWithSwitchCase()
252 ReplaceNonUniformAccessWithSwitchCase( Instruction* access_chain_final_user, Instruction* access_chain, uint32_t number_of_elements, const std::deque<Instruction*>& insts_to_be_cloned) const ReplaceNonUniformAccessWithSwitchCase() argument
H A Dcopy_prop_arrays.cpp375 uint32_t number_of_elements = 0;
377 number_of_elements =
382 number_of_elements = length_const->GetU32();
384 number_of_elements = vector_type->element_count();
386 number_of_elements = matrix_type->element_count();
389 if (number_of_elements == 0) {
397 if (insert_inst->GetSingleWordInOperand(2) != number_of_elements - 1) {
418 if (last_access->GetU32() != number_of_elements - 1) {
426 for (uint32_t i = number_of_elements - 1; i > 0; --i) {
H A Dreplace_desc_array_access_using_var_index.h69 // indices with constant elements. |number_of_elements| is the number
72 uint32_t number_of_elements) const;
103 // |access_chain| from 0 to |number_of_elements| - 1.
106 uint32_t number_of_elements,
H A Ddesc_sroa.cpp153 uint32_t number_of_elements = in GetReplacementVariable() local
157 .insert({var, std::vector<uint32_t>(number_of_elements, 0)}) in GetReplacementVariable()
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/
H A Dreplace_desc_array_access_using_var_index.cpp81 uint32_t number_of_elements = in ReplaceAccessChain() local
83 assert(number_of_elements != 0 && "Number of element is 0"); in ReplaceAccessChain()
84 if (number_of_elements == 1) { in ReplaceAccessChain()
89 ReplaceUsersOfAccessChain(access_chain, number_of_elements); in ReplaceAccessChain()
93 Instruction* access_chain, uint32_t number_of_elements) const { in ReplaceUsersOfAccessChain()
100 inst, access_chain, number_of_elements, insts_to_be_cloned); in ReplaceUsersOfAccessChain()
254 uint32_t number_of_elements, in ReplaceNonUniformAccessWithSwitchCase()
266 for (uint32_t idx = 0; idx < number_of_elements; ++idx) { in ReplaceNonUniformAccessWithSwitchCase()
252 ReplaceNonUniformAccessWithSwitchCase( Instruction* access_chain_final_user, Instruction* access_chain, uint32_t number_of_elements, const std::deque<Instruction*>& insts_to_be_cloned) const ReplaceNonUniformAccessWithSwitchCase() argument
H A Dcopy_prop_arrays.cpp375 uint32_t number_of_elements = 0;
377 number_of_elements =
382 number_of_elements = length_const->GetU32();
384 number_of_elements = vector_type->element_count();
386 number_of_elements = matrix_type->element_count();
389 if (number_of_elements == 0) {
397 if (insert_inst->GetSingleWordInOperand(2) != number_of_elements - 1) {
418 if (last_access->GetU32() != number_of_elements - 1) {
426 for (uint32_t i = number_of_elements - 1; i > 0; --i) {
H A Dreplace_desc_array_access_using_var_index.h69 // indices with constant elements. |number_of_elements| is the number
72 uint32_t number_of_elements) const;
103 // |access_chain| from 0 to |number_of_elements| - 1.
106 uint32_t number_of_elements,
H A Ddesc_sroa.cpp153 uint32_t number_of_elements = in GetReplacementVariable() local
157 .insert({var, std::vector<uint32_t>(number_of_elements, 0)}) in GetReplacementVariable()
/third_party/spirv-tools/source/opt/
H A Dreplace_desc_array_access_using_var_index.cpp80 uint32_t number_of_elements = in ReplaceAccessChain() local
82 assert(number_of_elements != 0 && "Number of element is 0"); in ReplaceAccessChain()
83 if (number_of_elements == 1) { in ReplaceAccessChain()
88 ReplaceUsersOfAccessChain(access_chain, number_of_elements); in ReplaceAccessChain()
92 Instruction* access_chain, uint32_t number_of_elements) const { in ReplaceUsersOfAccessChain()
99 inst, access_chain, number_of_elements, insts_to_be_cloned); in ReplaceUsersOfAccessChain()
255 uint32_t number_of_elements, in ReplaceNonUniformAccessWithSwitchCase()
271 for (uint32_t idx = 0; idx < number_of_elements; ++idx) { in ReplaceNonUniformAccessWithSwitchCase()
253 ReplaceNonUniformAccessWithSwitchCase( Instruction* access_chain_final_user, Instruction* access_chain, uint32_t number_of_elements, const std::deque<Instruction*>& insts_to_be_cloned) const ReplaceNonUniformAccessWithSwitchCase() argument
H A Dcopy_prop_arrays.cpp363 uint32_t number_of_elements = 0;
365 number_of_elements =
370 number_of_elements = length_const->GetU32();
372 number_of_elements = vector_type->element_count();
374 number_of_elements = matrix_type->element_count();
377 if (number_of_elements == 0) {
385 if (insert_inst->GetSingleWordInOperand(2) != number_of_elements - 1) {
401 if (!IsAccessChainIndexValidAndEqualTo(last_access, number_of_elements - 1)) {
409 for (uint32_t i = number_of_elements - 1; i > 0; --i) {
H A Dreplace_desc_array_access_using_var_index.h69 // indices with constant elements. |number_of_elements| is the number
72 uint32_t number_of_elements) const;
104 // |access_chain| from 0 to |number_of_elements| - 1.
107 uint32_t number_of_elements,
H A Ddesc_sroa.cpp154 uint32_t number_of_elements = in GetReplacementVariable() local
158 .insert({var, std::vector<uint32_t>(number_of_elements, 0)}) in GetReplacementVariable()
/third_party/node/deps/v8/src/builtins/
H A Dbuiltins-collections-gen.cc1429 TNode<IntPtrT> number_of_elements =
1434 IntPtrAdd(number_of_elements, number_of_deleted_elements);
1577 const TNode<IntPtrT> number_of_elements = SmiUntag(
1581 occupancy = IntPtrAdd(number_of_elements, number_of_deleted);
1637 const TNode<Smi> number_of_elements =
1641 SmiAdd(number_of_elements, SmiConstant(1)));
1675 const TNode<Smi> number_of_elements = SmiSub(
1679 table, OrderedHashMap::NumberOfElementsOffset(), number_of_elements);
1693 GotoIf(SmiLessThan(SmiAdd(number_of_elements, number_of_elements),
[all...]
H A Dbuiltins-collections-gen.h155 TNode<IntPtrT> number_of_elements);
189 TNode<IntPtrT> number_of_elements,
201 TNode<IntPtrT> number_of_elements);
202 TNode<BoolT> ShouldRehash(TNode<IntPtrT> number_of_elements,
205 TNode<IntPtrT> number_of_elements);
/third_party/node/deps/v8/include/cppgc/
H A Dheap-consistency.h110 * \param number_of_elements Number of elements that should be processed,
117 size_t element_size, size_t number_of_elements, in DijkstraWriteBarrierRange()
120 params, first_element, element_size, number_of_elements, in DijkstraWriteBarrierRange()
115 DijkstraWriteBarrierRange( const WriteBarrierParams& params, const void* first_element, size_t element_size, size_t number_of_elements, TraceCallback trace_callback) DijkstraWriteBarrierRange() argument
/third_party/node/deps/v8/include/v8-include/cppgc/
H A Dheap-consistency.h134 * \param number_of_elements Number of elements that should be processed,
141 size_t element_size, size_t number_of_elements, in DijkstraWriteBarrierRange()
144 params, first_element, element_size, number_of_elements, in DijkstraWriteBarrierRange()
139 DijkstraWriteBarrierRange( const WriteBarrierParams& params, const void* first_element, size_t element_size, size_t number_of_elements, TraceCallback trace_callback) DijkstraWriteBarrierRange() argument
/third_party/node/deps/v8/src/heap/cppgc/
H A Dwrite-barrier.cc84 size_t number_of_elements, TraceCallback trace_callback) { in DijkstraMarkingBarrierRangeSlow()
94 while (number_of_elements-- > 0) { in DijkstraMarkingBarrierRangeSlow()
82 DijkstraMarkingBarrierRangeSlow( HeapHandle& heap_handle, const void* first_element, size_t element_size, size_t number_of_elements, TraceCallback trace_callback) DijkstraMarkingBarrierRangeSlow() argument
/third_party/node/deps/v8/include/v8-include/cppgc/internal/
H A Dwrite-barrier.h96 size_t number_of_elements, TraceCallback trace_callback);
134 size_t number_of_elements,
434 size_t number_of_elements, in DijkstraMarkingBarrierRange()
438 number_of_elements, trace_callback); in DijkstraMarkingBarrierRange()
431 DijkstraMarkingBarrierRange(const Params& params, const void* first_element, size_t element_size, size_t number_of_elements, TraceCallback trace_callback) DijkstraMarkingBarrierRange() argument
/third_party/node/deps/v8/include/cppgc/internal/
H A Dwrite-barrier.h77 size_t number_of_elements, TraceCallback trace_callback);
119 size_t number_of_elements,
380 size_t number_of_elements, in DijkstraMarkingBarrierRange()
384 number_of_elements, trace_callback); in DijkstraMarkingBarrierRange()
377 DijkstraMarkingBarrierRange(const Params& params, const void* first_element, size_t element_size, size_t number_of_elements, TraceCallback trace_callback) DijkstraMarkingBarrierRange() argument
/third_party/node/deps/v8/src/base/
H A Dsmall-vector.h179 T* AllocateDynamicStorage(size_t number_of_elements) { in AllocateDynamicStorage() argument
180 return allocator_.allocate(number_of_elements); in AllocateDynamicStorage()
/third_party/skia/third_party/externals/piex/src/
H A Dtiff_parser.cc484 std::uint32_t number_of_elements; in ParseDirectory() local
487 Get32u(stream, ifd_offset + 6 + i, endian, &number_of_elements)) { in ParseDirectory()
498 // Check that type_size * number_of_elements does not exceed UINT32_MAX. in ParseDirectory()
499 if (type_size != 0 && number_of_elements > UINT32_MAX / type_size) { in ParseDirectory()
503 type_size * static_cast<size_t>(number_of_elements); in ParseDirectory()
522 tiff_directory->AddEntry(tag, type, number_of_elements, value_offset, data); in ParseDirectory()

Completed in 27 milliseconds

12