Home | History | Annotate | Download | only in src

Lines Matching refs:nb

1813                            size_t nb) {
1817   mchunkptr q = chunk_plus_offset(p, nb);
1818   size_t qsize = psize - nb;
1819   set_size_and_pinuse_of_inuse_chunk(m, p, nb);
1849   check_malloced_chunk(m, chunk2mem(p), nb);
1857 static void* sys_alloc(mstate m, size_t nb) {
1865 static void* tmalloc_large(mstate m, size_t nb) {
1867   size_t rsize = -nb; /* Unsigned negation */
1870   compute_tree_index(nb, idx);
1873     /* Traverse tree for this bin looking for node with size == nb */
1874     size_t sizebits = nb << leftshift_for_tree_index(idx);
1878       size_t trem = chunksize(t) - nb;
1889         t = rst; /* set t to least subtree holding sizes > nb */
1907     size_t trem = chunksize(t) - nb;
1916   if (v != 0 && rsize < (size_t)(m->dvsize - nb)) {
1918       mchunkptr r = chunk_plus_offset(v, nb);
1919       assert(m->user_data, chunksize(v) == rsize + nb);
1923           set_inuse_and_pinuse(m, v, (rsize + nb));
1925           set_size_and_pinuse_of_inuse_chunk(m, v, nb);
1938 static void* tmalloc_small(mstate m, size_t nb) {
1946   rsize = chunksize(t) - nb;
1949     size_t trem = chunksize(t) - nb;
1957     mchunkptr r = chunk_plus_offset(v, nb);
1958     assert(m->user_data, chunksize(v) == rsize + nb);
1962         set_inuse_and_pinuse(m, v, (rsize + nb));
1964         set_size_and_pinuse_of_inuse_chunk(m, v, nb);
1994       size_t nb = request2size(bytes);
1995       if (oldsize >= nb) { /* already big enough */
1996         size_t rsize = oldsize - nb;
1999           mchunkptr remainder = chunk_plus_offset(newp, nb);
2000           set_inuse(m, newp, nb);
2005       else if (next == m->top && oldsize + m->topsize > nb) {
2008         size_t newtopsize = newsize - nb;
2009         mchunkptr newtop = chunk_plus_offset(oldp, nb);
2010         set_inuse(m, oldp, nb);
2064     size_t nb = request2size(bytes);
2065     size_t req = nb + alignment + MIN_CHUNK_SIZE - CHUNK_OVERHEAD;
2100       assert(m->user_data, chunksize(p) >= nb);
2165     size_t nb;
2169       nb = (bytes < MIN_REQUEST)? MIN_CHUNK_SIZE : pad_request(bytes);
2170       idx = small_index(nb);
2182         check_malloced_chunk(ms, mem, nb);
2186       else if (nb > ms->dvsize) {
2198           rsize = small_index2size(i) - nb;
2203             set_size_and_pinuse_of_inuse_chunk(ms, p, nb);
2204             r = chunk_plus_offset(p, nb);
2209           check_malloced_chunk(ms, mem, nb);
2213         else if (ms->treemap != 0 && (mem = tmalloc_small(ms, nb)) != 0) {
2214           check_malloced_chunk(ms, mem, nb);
2220       nb = MAX_SIZE_T; /* Too big to allocate. Force failure (in sys alloc) */
2222       nb = pad_request(bytes);
2223       if (ms->treemap != 0 && (mem = tmalloc_large(ms, nb)) != 0) {
2224         check_malloced_chunk(ms, mem, nb);
2229     if (nb <= ms->dvsize) {
2230       size_t rsize = ms->dvsize - nb;
2233         mchunkptr r = ms->dv = chunk_plus_offset(p, nb);
2236         set_size_and_pinuse_of_inuse_chunk(ms, p, nb);
2245       check_malloced_chunk(ms, mem, nb);
2249     else if (nb < ms->topsize) { /* Split top */
2250       size_t rsize = ms->topsize -= nb;
2252       mchunkptr r = ms->top = chunk_plus_offset(p, nb);
2254       set_size_and_pinuse_of_inuse_chunk(ms, p, nb);
2257       check_malloced_chunk(ms, mem, nb);
2261     mem = sys_alloc(ms, nb);