/external/bluetooth/bluez/src/ |
dbus-common.h | 30 void *val, int n_elements);
|
dbus-common.c | 65 int n_elements) 79 n_elements); 84 for (i = 0; i < n_elements; i++) 116 void *val, int n_elements) 125 append_array_variant(&entry, type, val, n_elements);
|
/external/webkit/Source/JavaScriptCore/wtf/wince/ |
MemoryManager.cpp | 116 void *fastCalloc(size_t n_elements, size_t element_size) { return calloc(n_elements, element_size); } 123 void *fastCalloc(size_t n_elements, size_t element_size) { return MemoryManager::m_calloc(n_elements, element_size); } 154 TryMallocReturnValue tryFastCalloc(size_t n_elements, size_t element_size) 157 return fastCalloc(n_elements, element_size);
|
FastMallocWinCE.h | 34 void* fastCalloc(size_t n_elements, size_t element_size); 41 void* tryFastCalloc(size_t n_elements, size_t element_size); 53 #define calloc(n_elements, element_size) fastCalloc(n_elements, element_size)
|
/external/valgrind/main/coregrind/ |
m_hashtable.c | 45 UInt n_elements; member in struct:_VgHashTable 76 table->n_elements = 0; 85 return table->n_elements; 119 (UWord)table->n_elements ); 148 table->n_elements++; 149 if ( (1 * (ULong)table->n_elements) > (1 * (ULong)table->n_chains) ) { 184 table->n_elements--; 203 *n_elems = table->n_elements;
|
/bionic/libc/bionic/ |
malloc_debug_common.h | 78 void* (*calloc)(size_t n_elements, size_t elem_size);
|
malloc_debug_qemu.c | 607 void* qemu_instrumented_calloc(size_t n_elements, size_t elem_size); 791 qemu_instrumented_calloc(size_t n_elements, size_t elem_size) 798 if (n_elements == 0 || elem_size == 0) { 807 if (n_elements && MAX_SIZE_T / n_elements < elem_size) { 829 desc.requested_bytes = n_elements * elem_size; [all...] |
dlmalloc.h | 94 calloc(size_t n_elements, size_t element_size); 95 Returns a pointer to n_elements * element_size bytes, with all locations 272 independent_calloc(size_t n_elements, size_t element_size, void* chunks[]); 275 single cleared space, it returns an array of pointers to n_elements 287 n_elements in length. It is filled in with the pointers to the 291 null if the allocation failed. If n_elements is zero and "chunks" 326 independent_comalloc(size_t n_elements, size_t sizes[], void* chunks[]); 328 independent_comalloc allocates, all at once, a set of n_elements 339 must be of at least n_elements in length. It is filled in with the 343 null if the allocation failed. If n_elements is zero and chunks i [all...] |
malloc_debug_leak.c | 400 void* chk_calloc(size_t n_elements, size_t elem_size) 407 if (n_elements && MAX_SIZE_T / n_elements < elem_size) { 410 size = n_elements * elem_size; 565 void* leak_calloc(size_t n_elements, size_t elem_size) 572 if (n_elements && MAX_SIZE_T / n_elements < elem_size) { 575 size = n_elements * elem_size;
|
dlmalloc.c | [all...] |
malloc_debug_common.c | 225 void* calloc(size_t n_elements, size_t elem_size) { 226 return __libc_malloc_dispatch->calloc(n_elements, elem_size);
|
/external/dbus/dbus/ |
dbus-marshal-basic.c | 875 int n_elements, 882 _dbus_string_init_const_len (&value_str, value, n_elements); 886 if (!_dbus_string_copy_len (&value_str, 0, n_elements, 890 pos += n_elements; 902 * @param n_elements number of elements 907 int n_elements, 919 end = d + (n_elements * alignment); 956 int n_elements, 968 n_elements, alignment); 976 int n_elements, [all...] |
dbus-marshal-recursive.h | 116 int *n_elements); 167 int n_elements);
|
dbus-marshal-basic.h | 225 int n_elements, 238 int n_elements, 270 int n_elements,
|
dbus-message.h | 239 int *n_elements); 253 int n_elements);
|
dbus-message.c | 836 int n_elements; local 848 n_elements = 0; 851 ++n_elements; 855 str_array = dbus_new0 (char*, n_elements + 1); 866 while (i < n_elements) 883 _dbus_assert (i == n_elements); 887 _dbus_assert (i == n_elements); 891 *n_elements_p = n_elements; 1719 int n_elements; local 1738 int n_elements; local [all...] |
dbus-marshal-recursive-util.c | 1297 int n_elements; local 2167 int n_elements; local 2304 int n_elements; local [all...] |
dbus-marshal-recursive.c | 908 * @param n_elements place to return number of array elements 913 int *n_elements) 953 *n_elements = remaining_len / alignment; [all...] |
/prebuilt/linux-x86/toolchain/arm-eabi-4.4.0/lib/gcc/arm-eabi/4.4.0/plugin/include/ |
hashtab.h | 117 size_t n_elements; local
|
/prebuilt/linux-x86/toolchain/arm-eabi-4.4.3/lib/gcc/arm-eabi/4.4.3/plugin/include/ |
hashtab.h | 117 size_t n_elements; local
|
/prebuilt/linux-x86/toolchain/arm-linux-androideabi-4.4.x/lib/gcc/arm-linux-androideabi/4.4.3/plugin/include/ |
hashtab.h | 117 size_t n_elements; local
|
/external/libffi/src/ |
dlmalloc.c | 687 calloc(size_t n_elements, size_t element_size); 688 Returns a pointer to n_elements * element_size bytes, with all locations [all...] |
/external/qemu/distrib/sdl-1.2.12/src/stdlib/ |
SDL_malloc.c | 731 calloc(size_t n_elements, size_t element_size); 732 Returns a pointer to n_elements * element_size bytes, with all locations [all...] |
/external/webkit/Source/JavaScriptCore/wtf/ |
FastMalloc.h | 73 TryMallocReturnValue tryFastCalloc(size_t n_elements, size_t element_size);
|
/external/v8/test/mjsunit/ |
unicode-test.js | [all...] |