Home
last modified time | relevance | path

Searched refs:number_of_elements (Results 1 – 9 of 9) sorted by relevance

/external/cmockery/cmockery_0_1_2/src/example/
Dallocate_module.c20 extern void* _test_calloc(const size_t number_of_elements, const size_t size,
Dcalculator.c64 void* _test_calloc(const size_t number_of_elements, const size_t size,
/external/piex/src/
Dtiff_parser.cc481 std::uint32_t number_of_elements; in ParseDirectory() local
484 Get32u(stream, ifd_offset + 6 + i, endian, &number_of_elements)) { in ParseDirectory()
496 if (type_size != 0 && number_of_elements > UINT32_MAX / type_size) { in ParseDirectory()
500 type_size * static_cast<size_t>(number_of_elements); in ParseDirectory()
519 tiff_directory->AddEntry(tag, type, number_of_elements, value_offset, data); in ParseDirectory()
/external/v8/src/
Delements.cc2283 int number_of_elements = args->length(); in ArrayConstructInitializeElements() local
2285 array, args, 0, number_of_elements, ALLOW_CONVERTED_DOUBLE_ELEMENTS); in ArrayConstructInitializeElements()
2292 factory->NewFixedDoubleArray(number_of_elements)); in ArrayConstructInitializeElements()
2295 factory->NewFixedArrayWithHoles(number_of_elements)); in ArrayConstructInitializeElements()
2303 for (int entry = 0; entry < number_of_elements; entry++) { in ArrayConstructInitializeElements()
2313 for (int entry = 0; entry < number_of_elements; entry++) { in ArrayConstructInitializeElements()
2322 for (int entry = 0; entry < number_of_elements; entry++) { in ArrayConstructInitializeElements()
2333 array->set_length(Smi::FromInt(number_of_elements)); in ArrayConstructInitializeElements()
Dfactory.cc1916 size_t number_of_elements, in NewJSTypedArray() argument
1923 CHECK(number_of_elements <= in NewJSTypedArray()
1925 CHECK(number_of_elements <= static_cast<size_t>(Smi::kMaxValue)); in NewJSTypedArray()
1926 size_t byte_length = number_of_elements * element_size; in NewJSTypedArray()
1933 NewNumberFromSize(number_of_elements, pretenure); in NewJSTypedArray()
1942 static_cast<int>(number_of_elements), array_type, true, pretenure); in NewJSTypedArray()
Dfactory.h463 size_t number_of_elements,
Dobjects.cc5662 int number_of_elements = dictionary->NumberOfElements(); in MigrateSlowToFast() local
5663 if (number_of_elements > kMaxNumberOfDescriptors) return; in MigrateSlowToFast()
5666 if (number_of_elements != dictionary->NextEnumerationIndex()) { in MigrateSlowToFast()
/external/cmockery/cmockery_0_1_2/src/
Dcmockery.c1286 void* _test_calloc(const size_t number_of_elements, const size_t size, in _test_calloc() argument
1288 void* const ptr = _test_malloc(number_of_elements * size, file, line); in _test_calloc()
1290 memset(ptr, 0, number_of_elements * size); in _test_calloc()
/external/cmockery/cmockery_0_1_2/src/google/
Dcmockery.h418 void* _test_calloc(const size_t number_of_elements, const size_t size,