| /glibc-2.36/malloc/ |
| D | mtrace.pl | 171 if (defined $allocated{$allocaddr}) {
176 $allocated{$allocaddr}=$howmuch;
182 if (defined $allocated{$allocaddr}) {
183 undef $allocated{$allocaddr};
192 if (defined $allocated{$allocaddr}) {
193 undef $allocated{$allocaddr};
202 if (defined $allocated{$allocaddr}) {
204 hex($allocaddr), $nr, $allocated{$allocaddr},
207 $allocated{$allocaddr}=$howmuch;
225 @addrs= keys %allocated;
[all …]
|
| D | dynarray_emplace_enlarge.c | 30 if (list->allocated == 0) in __libc_dynarray_emplace_enlarge()
45 new_allocated = list->allocated + list->allocated / 2 + 1; in __libc_dynarray_emplace_enlarge()
46 if (new_allocated <= list->allocated) in __libc_dynarray_emplace_enlarge()
70 list->allocated = new_allocated; in __libc_dynarray_emplace_enlarge()
|
| D | tst-malloc_info.c | 53 size_t allocated = 0; in allocation_thread_function() local
54 while (allocated < per_thread_allocations) in allocation_thread_function()
57 allocated += sizeof (*new_head); in allocation_thread_function()
|
| D | dynarray-skeleton.c | 135 size_t allocated; member
200 list->u.dynarray_header.allocated = DYNARRAY_INITIAL_SIZE; in DYNARRAY_NAME()
220 return list->u.dynarray_header.allocated == __dynarray_error_marker (); in DYNARRAY_NAME()
234 list->u.dynarray_header.allocated = __dynarray_error_marker (); in DYNARRAY_NAME()
307 == list->u.dynarray_header.allocated)) in DYNARRAY_NAME()
366 == list->u.dynarray_header.allocated)) in DYNARRAY_NAME()
|
| D | dynarray_resize.c | 30 if (size <= list->allocated) in __libc_dynarray_resize()
60 list->allocated = size; in __libc_dynarray_resize()
|
| D | dynarray.h | 104 size_t allocated; member
121 return list->allocated == __dynarray_error_marker (); in __dynarray_error()
|
| D | tst-dynarray.c | 114 <= dyn.u.dynarray_header.allocated); in test_int()
117 TEST_VERIFY_EXIT (count <= dyn.u.dynarray_header.allocated); in test_int()
153 TEST_VERIFY_EXIT (dyn.u.dynarray_header.allocated in test_int()
243 <= dyn.u.dynarray_header.allocated); in test_str()
246 TEST_VERIFY_EXIT (count <= dyn.u.dynarray_header.allocated); in test_str()
282 TEST_VERIFY_EXIT (dyn.u.dynarray_header.allocated in test_str()
|
| D | tst-dynarray-fail.c | 254 TEST_VERIFY_EXIT (dyn.u.dynarray_header.allocated > 0); in test_str_fail()
283 TEST_VERIFY_EXIT (dyn.u.dynarray_header.allocated > 0); in test_str_fail()
|
| D | tst-dynarray-shared.h | 53 TEST_VERIFY_EXIT ((dyn)->u.dynarray_header.allocated > 0); \
|
| /glibc-2.36/sysdeps/posix/ |
| D | getcwd.c | 187 size_t allocated = size; in __getcwd_generic() local
191 if (allocated == 1) in __getcwd_generic()
244 allocated = BIG_FILE_NAME_LENGTH + 1; in __getcwd_generic()
249 dir = malloc (allocated); in __getcwd_generic()
256 dirp = dir + allocated; in __getcwd_generic()
427 size_t oldsize = allocated; in __getcwd_generic()
429 allocated += MAX (allocated, namlen); in __getcwd_generic()
430 if (allocated < oldsize in __getcwd_generic()
431 || ! (tmp = realloc (dir, allocated))) in __getcwd_generic()
436 dirp = memcpy (tmp + allocated - (oldsize - dirroom), in __getcwd_generic()
[all …]
|
| /glibc-2.36/elf/ |
| D | stringtable.c | 35 table->allocated = 128; in stringtable_init()
37 table->entries = xcalloc (table->allocated, sizeof (table->entries[0])); in stringtable_init()
60 uint32_t new_allocated = table->allocated * 2; in stringtable_rehash()
65 for (uint32_t i = 0; i < table->allocated; ++i) in stringtable_rehash()
78 table->allocated = new_allocated; in stringtable_rehash()
85 if (table->allocated == 0) in stringtable_add()
95 = table->entries[hash & (table->allocated - 1)]; in stringtable_add()
104 if (table->count * 3 > table->allocated * 2) in stringtable_add()
111 uint32_t index = hash & (table->allocated - 1); in stringtable_add()
163 for (uint32_t i = 0; i < table->allocated; ++i) in stringtable_finalize()
[all …]
|
| D | dl-find_object.c | 119 size_t allocated; member
151 count += seg->allocated; in _dlfo_mappings_segment_count_allocated()
184 result->allocated = size; in _dlfo_mappings_segment_allocate_unpadded()
203 minimum_growth = 2* previous->allocated; in _dlfo_mappings_segment_allocate()
233 result->allocated = (((uintptr_t) (end - ptr) in _dlfo_mappings_segment_allocate()
236 assert (result->allocated >= size); in _dlfo_mappings_segment_allocate()
639 if (remaining_to_add < seg->allocated) in _dlfo_update_init_seg()
643 new_seg_size = seg->allocated; in _dlfo_update_init_seg()
|
| D | dl-tls.c | 436 void *allocated = malloc (size + alignment + sizeof (void *)); in _dl_allocate_tls_storage() local
437 if (__glibc_unlikely (allocated == NULL)) in _dl_allocate_tls_storage()
445 void *aligned = (void *) roundup ((uintptr_t) allocated, alignment); in _dl_allocate_tls_storage()
458 (sizeof (void *) + TLS_PRE_TCB_SIZE + (uintptr_t) allocated, in _dl_allocate_tls_storage()
469 *tcb_to_pointer_to_free_location (result) = allocated; in _dl_allocate_tls_storage()
473 free (allocated); in _dl_allocate_tls_storage()
|
| D | stringtable_free.c | 24 for (uint32_t i = 0; i < table->allocated; ++i) in stringtable_free()
|
| D | stringtable.h | 39 uint32_t allocated; /* Length of the entries array. */ member
|
| /glibc-2.36/libio/ |
| D | vasprintf.c | 42 size_t allocated; in __vasprintf_internal() local
66 allocated = sf._sbf._f._IO_write_end - sf._sbf._f._IO_write_base; in __vasprintf_internal()
67 if ((allocated >> 1) <= needed) in __vasprintf_internal()
|
| /glibc-2.36/rt/ |
| D | aio_cancel.c | 90 if (req->running == allocated) in __aio_cancel()
116 if (req->running == allocated) in __aio_cancel()
|
| D | aio_misc.c | 434 running = newp->running = allocated; in __aio_enqueue_request()
514 assert (runp->running == allocated); in handle_fildes_io()
611 assert (runp->running == allocated); in handle_fildes_io()
653 runp->running = allocated; in handle_fildes_io()
|
| /glibc-2.36/manual/ |
| D | memory.texi | 124 that was allocated by exec. When the program exits or execs, you might
140 static constants. It is allocated by exec and stays the same size for
190 space, of a fixed size. The space is allocated once, when your program
198 for an automatic variable is allocated when the compound statement
240 stored in dynamically allocated space. The only way to get dynamically
241 allocated memory is via a system call (which is generally via a @glibcadj{}
243 allocated space is through a pointer. Because it is less convenient,
250 foobar} whose contents are the dynamically allocated space. But you can
289 than a page. These requests are allocated with @code{mmap} (anonymous or via
583 This function returns a pointer to a newly allocated block @var{size}
[all …]
|
| D | tunables.texi | 154 on some low order bits of this tunable when they are allocated (except when
155 allocated by @code{calloc}) and freed. This can be used to debug the use of
168 allocated outside the normal heap, using the @code{mmap} system call. This way
171 allocated via @code{mmap}.
316 static TLS. This is a minimum value and additional space may be allocated
325 changed once allocated at process startup. The default allocation of
326 optional static TLS is 512 bytes and is allocated in every thread.
|
| D | string.texi | 60 or dynamically allocated memory (@pxref{Memory Allocation}). It's up to
109 The amount of memory allocated for a byte array may extend past the null byte
111 document, the term @dfn{allocated size} is always used to refer to the
112 total amount of memory allocated for an array, while the term
123 string than fit in its allocated size. When writing code that extends
124 strings or moves bytes into a pre-allocated array, you should be
244 the length of the string stored there, not its allocated size. You can
245 get the allocated size of the array that holds a string using
371 function might get stuck in a loop trashing all the memory allocated to
568 allocated string. The string is allocated using @code{malloc}; see
[all …]
|
| D | search.texi | 115 the element one is searching for the memory allocated for the array
288 hashing table used through the whole program. The table is allocated
308 allocated in a previous call of @code{hcreate}. After a call to this
409 necessary for the @code{struct hsearch_data} object can be allocated
430 The @code{hdestroy_r} function frees all resources allocated by the
558 @code{tdestroy}. It frees all resources allocated by the @code{tsearch}
|
| /glibc-2.36/sysdeps/generic/ |
| D | aio_misc.h | 66 allocated, enumerator
|
| /glibc-2.36/posix/ |
| D | transbug.c | 74 pat.allocated = 0; /* regex will allocate the buffer */ in run_test()
|
| D | regex.h | 420 __re_long_size_t __REPB_PREFIX(allocated);
|