Lines Matching refs:sizes
49 Minimum overhead per allocated chunk: 4 or 8 bytes (if 4byte sizes)
50 8 or 16 bytes (if 8byte sizes)
864 independent_comalloc(size_t n_elements, size_t sizes[], void* chunks[]);
867 chunks with sizes indicated in the "sizes" array. It returns
904 size_t sizes[3] = { sizeof(struct Head), msglen, sizeof(struct Foot) };
906 if (independent_comalloc(3, sizes, chunks) == 0)
1009 control the sizes of incremental increases of this space by
1085 size_t sizes[], void* chunks[]);
1472 techniques.) Sizes of free chunks are stored both in the front of
1611 /* ------------------- Chunks sizes and alignments ----------------------- */
1636 /* Bounds on request (not chunk) sizes. */
1739 constraints on user chunk sizes. Each node looks like:
1764 Each tree holding treenodes is a tree of unique chunk sizes. Chunks
1772 Each tree contains a power of 2 sized range of chunk sizes (the
1780 sizes than its right subtree. However, the node at the root of each
1782 dividing line between the subtree sizes is based on trie relation.)
1798 (for 32 bit sizes) or up to 53 (for 64 bit sizes). The typical case
1951 with sizes less than MIN_LARGE_SIZE bytes. Each bin contains
1961 sizes. There are 2 equally spaced treebins for each power of two
2002 /* Bin types, widths and sizes */
2346 believe all pointers, sizes, maps etc held in malloc_state, but
3305 /* Determine locations and sizes of segment, fenceposts, old top */
3683 t = rst; /* set t to least subtree holding sizes > nb */
3932 size_t* sizes,
3940 bit 0 set if all elements are same size (using sizes[0])
3973 element_size = request2size(*sizes);
3976 else { /* add up all the sizes */
3980 contents_size += request2size(sizes[i]);
4025 size = request2size(sizes[i]);
4043 assert(remainder_size == request2size(sizes[i]));
4121 /* Fit here cannot be remainderless if 4byte sizes */
4341 void** dlindependent_comalloc(size_t n_elements, size_t sizes[],
4343 return ialloc(gm, n_elements, sizes, 0, chunks);
4528 /* Fit here cannot be remainderless if 4byte sizes */
4756 size_t sizes[], void* chunks[]) {
4762 return ialloc(ms, n_elements, sizes, 0, chunks);
