/external/compiler-rt/lib/asan/tests/ |
asan_benchmarks_test.cc | 19 static void ManyAccessFunc(T *x, size_t n_elements, size_t n_iter) { 23 for (size_t i = 0; i <= n_elements - 16; i += 16) {
|
/external/dlmalloc/ |
malloc.h | 126 calloc(size_t n_elements, size_t element_size); 127 Returns a pointer to n_elements * element_size bytes, with all locations 333 independent_calloc(size_t n_elements, size_t element_size, void* chunks[]); 336 single cleared space, it returns an array of pointers to n_elements 348 n_elements in length. It is filled in with the pointers to the 352 null if the allocation failed. If n_elements is zero and "chunks" 384 independent_comalloc(size_t n_elements, size_t sizes[], void* chunks[]); 386 independent_comalloc allocates, all at once, a set of n_elements 397 must be of at least n_elements in length. It is filled in with the 401 null if the allocation failed. If n_elements is zero and chunks i [all...] |
malloc.c | [all...] |
/external/valgrind/coregrind/ |
m_hashtable.c | 47 UInt n_elements; member in struct:_VgHashTable 78 table->n_elements = 0; 87 return table->n_elements; 121 (UWord)table->n_elements ); 150 table->n_elements++; 151 if ( (1 * (ULong)table->n_elements) > (1 * (ULong)table->n_chains) ) { 203 table->n_elements--; 227 table->n_elements--; 337 *n_elems = table->n_elements;
|
/external/dbus/dbus/ |
dbus-marshal-recursive.h | 116 int *n_elements); 165 int n_elements);
|
dbus-marshal-basic.c | 918 int n_elements, 925 _dbus_string_init_const_len (&value_str, value, n_elements); 929 if (!_dbus_string_copy_len (&value_str, 0, n_elements, 933 pos += n_elements; 945 * @param n_elements number of elements 950 int n_elements, 962 end = d + (n_elements * alignment); 999 int n_elements, 1011 n_elements, alignment); 1019 int n_elements, [all...] |
dbus-marshal-basic.h | 191 int n_elements, 204 int n_elements, 234 int n_elements,
|
dbus-message.c | 897 int n_elements; local 909 n_elements = 0; 912 ++n_elements; 916 str_array = dbus_new0 (char*, n_elements + 1); 927 while (i < n_elements) 944 _dbus_assert (i == n_elements); 948 _dbus_assert (i == n_elements); 952 *n_elements_p = n_elements; 1791 int n_elements; local 1808 int n_elements; local [all...] |
dbus-message.h | 239 int *n_elements); 253 int n_elements);
|
dbus-marshal-recursive-util.c | 1297 int n_elements; local 2182 int n_elements; local 2319 int n_elements; local [all...] |
dbus-marshal-recursive.c | 920 * @param n_elements place to return number of array elements 925 int *n_elements) 965 *n_elements = remaining_len / alignment; [all...] |
/external/compiler-rt/lib/asan/ |
asan_malloc_linux.cc | 150 void *(*calloc)(uptr n_elements, uptr elem_size); 157 void *(*calloc)(uptr n_elements, uptr elem_size);
|
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/ |
hashtab.h | 117 size_t n_elements; variable
|
/toolchain/binutils/binutils-2.25/include/ |
hashtab.h | 117 size_t n_elements; variable
|
/bionic/libc/bionic/ |
malloc_common.cpp | 79 extern "C" void* calloc(size_t n_elements, size_t elem_size) { 82 return _calloc(n_elements, elem_size); 84 return Malloc(calloc)(n_elements, elem_size);
|
/toolchain/binutils/binutils-2.25/libiberty/ |
hashtab.c | 223 #define htab_elements(htab) ((htab)->n_elements - (htab)->n_deleted) 471 htab->n_elements = 0; 556 htab->n_elements -= htab->n_deleted; 643 if (insert == INSERT && size * 3 <= htab->n_elements * 4) 694 htab->n_elements++;
|
/external/v8/test/mjsunit/ |
unicode-test.js | [all...] |