Lines Matching refs:chunks
85 MALLINFO_FIELD_TYPE ordblks; /* number of free chunks */
282 purposes. Traversal does not include include chunks that have been
291 For example, to count the number of in-use chunks with size greater
311 ordblks: the number of free chunks
333 independent_calloc(size_t n_elements, size_t element_size, void* chunks[]);
344 The "chunks" argument is optional (i.e., may be null, which is
347 no longer needed. Otherwise, the chunks array must be of at least
349 chunks.
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[]);
387 chunks with sizes indicated in the "sizes" array. It returns
394 The "chunks" argument is optional (i.e., may be null). If it is null
396 be freed when it is no longer needed. Otherwise, the chunks array
398 pointers to the chunks.
401 null if the allocation failed. If n_elements is zero and chunks is
422 void* chunks[3];
423 if (independent_comalloc(3, sizes, chunks) == 0)
425 struct Head* head = (struct Head*)(chunks[0]);
426 char* body = (char*)(chunks[1]);
427 struct Foot* foot = (struct Foot*)(chunks[2]);
436 since it cannot reuse existing noncontiguous small chunks that
468 memory will be locked between two used chunks, so they cannot be
492 zero even when no user-level chunks are allocated.
564 mspace_track_large_chunks controls whether requests for large chunks
566 others in this mspace. By default large chunks are not tracked,
567 which reduces fragmentation. However, such chunks are not
600 size_t elem_size, void* chunks[]);
602 size_t sizes[], void* chunks[]);
