Home
last modified time | relevance | path

Searched refs:number_of_elements (Results 1 – 12 of 12) 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/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/v8/src/
Dfactory.cc1913 size_t number_of_elements, in NewJSTypedArray() argument
1920 CHECK(number_of_elements <= in NewJSTypedArray()
1922 CHECK(number_of_elements <= static_cast<size_t>(Smi::kMaxValue)); in NewJSTypedArray()
1923 size_t byte_length = number_of_elements * element_size; in NewJSTypedArray()
1930 NewNumberFromSize(number_of_elements, pretenure); in NewJSTypedArray()
1939 static_cast<int>(number_of_elements), array_type, true, pretenure); in NewJSTypedArray()
Delements.cc2904 int number_of_elements = args->length(); in ArrayConstructInitializeElements() local
2906 array, args, 0, number_of_elements, ALLOW_CONVERTED_DOUBLE_ELEMENTS); in ArrayConstructInitializeElements()
2913 factory->NewFixedDoubleArray(number_of_elements)); in ArrayConstructInitializeElements()
2916 factory->NewFixedArrayWithHoles(number_of_elements)); in ArrayConstructInitializeElements()
2924 for (int entry = 0; entry < number_of_elements; entry++) { in ArrayConstructInitializeElements()
2934 for (int entry = 0; entry < number_of_elements; entry++) { in ArrayConstructInitializeElements()
2943 for (int entry = 0; entry < number_of_elements; entry++) { in ArrayConstructInitializeElements()
2954 array->set_length(Smi::FromInt(number_of_elements)); in ArrayConstructInitializeElements()
Dfactory.h477 size_t number_of_elements,
Dobjects.cc5748 int number_of_elements = dictionary->NumberOfElements(); in MigrateSlowToFast() local
5749 if (number_of_elements > kMaxNumberOfDescriptors) return; in MigrateSlowToFast()
5752 if (number_of_elements != dictionary->NextEnumerationIndex()) { in MigrateSlowToFast()
/external/cmockery/cmockery_0_1_2/src/google/
Dcmockery.h418 void* _test_calloc(const size_t number_of_elements, const size_t size,
/external/v8/src/compiler/
Djs-operator.cc850 int number_of_elements) { in CreateLiteralArray() argument
851 CreateLiteralParameters parameters(constant_elements, number_of_elements, in CreateLiteralArray()
Djs-operator.h424 int number_of_elements);
Dbytecode-graph-builder.cc912 int number_of_elements = constant_elements->length(); in VisitCreateArrayLiteral() local
914 constant_elements, literal_flags, literal_index, number_of_elements); in VisitCreateArrayLiteral()