Lines Matching refs:sizes
48 Minimum overhead per allocated chunk: 4 or 8 bytes (if 4byte sizes)
49 8 or 16 bytes (if 8byte sizes)
1127 independent_comalloc(size_t n_elements, size_t sizes[], void* chunks[]);
1130 chunks with sizes indicated in the "sizes" array. It returns
1164 size_t sizes[3] = { sizeof(struct Head), msglen, sizeof(struct Foot) };
1166 if (independent_comalloc(3, sizes, chunks) == 0)
1281 control the sizes of incremental increases of this space by
1371 size_t sizes[], void* chunks[]);
2059 techniques.) Sizes of free chunks are stored both in the front of
2198 /* ------------------- Chunks sizes and alignments ----------------------- */
2223 /* Bounds on request (not chunk) sizes. */
2330 constraints on user chunk sizes. Each node looks like:
2355 Each tree holding treenodes is a tree of unique chunk sizes. Chunks
2363 Each tree contains a power of 2 sized range of chunk sizes (the
2371 sizes than its right subtree. However, the node at the root of each
2373 dividing line between the subtree sizes is based on trie relation.)
2389 (for 32 bit sizes) or up to 53 (for 64 bit sizes). The typical case
2506 with sizes less than MIN_LARGE_SIZE bytes. Each bin contains
2516 sizes. There are 2 equally spaced treebins for each power of two
2569 /* Bin types, widths and sizes */
2988 believe all pointers, sizes, maps etc held in malloc_state, but
3997 /* Determine locations and sizes of segment, fenceposts, old top */
4479 t = rst; /* set t to least subtree holding sizes > nb */
4630 /* Fit here cannot be remainderless if 4byte sizes */
4990 bit 0 set if all elements are same size (using sizes[0])
4995 size_t* sizes,
5029 element_size = request2size(*sizes);
5032 else { /* add up all the sizes */
5036 contents_size += request2size(sizes[i]);
5081 size = request2size(sizes[i]);
5099 assert(remainder_size == request2size(sizes[i]));
5333 void** dlindependent_comalloc(size_t n_elements, size_t sizes[],
5335 return ialloc(gm, n_elements, sizes, 0, chunks);
5566 /* Fit here cannot be remainderless if 4byte sizes */
5859 size_t sizes[], void* chunks[]) {
5865 return ialloc(ms, n_elements, sizes, 0, chunks);
