Lines Matching refs:NEXT
4312 " struct Node { int item; struct Node* next; };\n" +
4323 " pool[i]->next = pool[i+1];\n" +
4713 " on the next line, as well as in programs that use this malloc.\n" +
5165 " user. \"Nextchunk\" is the beginning of the next contiguous chunk.\n" +
5178 " | Forward pointer to next chunk in list |\n" +
5201 " as the prev_size of the NEXT chunk. This makes it easier to\n" +
5208 " trailing size field since there is no next contiguous chunk\n" +
5299 "/* Ptr to next physical malloc_chunk. */\n" +
5477 " /* Use next 2 bits to create finer-granularity bins */\n" +
5887 " mchunkptr next = chunk_at_offset(p, sz);\n" +
5901 " assert(next->prev_size == sz);\n" +
5904 " assert (next == av->top || inuse(next));\n" +
5925 " mchunkptr next;\n" +
5929 " return; /* mmapped chunks have no next/prev */\n" +
5935 " next = next_chunk(p);\n" +
5948 " if (next == av->top) {\n" +
5949 " assert(prev_inuse(next));\n" +
5950 " assert(chunksize(next) >= MINSIZE);\n" +
5952 " else if (!inuse(next))\n" +
5953 " do_check_free_chunk(next);\n" +
6880 " Search for a chunk by scanning bins, starting with next largest\n" +
7015 " mchunkptr nextchunk; /* next contiguous chunk */\n" +
7182 " mchunkptr nextp; /* next chunk to consolidate */\n" +
7293 " mchunkptr next; /* next contiguous chunk after oldp */\n" +
7334 " next = chunk_at_offset(oldp, oldsize);\n" +
7337 " if (next == av->top &&\n" +
7338 " (CHUNK_SIZE_T)(newsize = oldsize + chunksize(next)) >=\n" +
7346 " /* Try to expand forward into next chunk; split off remainder below */\n" +
7347 " else if (next != av->top &&\n" +
7348 " !inuse(next) &&\n" +
7349 " (CHUNK_SIZE_T)(newsize = oldsize + chunksize(next)) >=\n" +
7352 " unlink(next, bck, fwd);\n" +
7365 " Avoid copy if newp is next chunk after oldp.\n" +
7367 " if (newp == next) {\n" +
7558 " we can move to the next aligned spot -- we've allocated enough\n" +
8299 " region_list_entry *next = HeapAlloc (GetProcessHeap (), 0, sizeof (region_list_entry));\n" +
8300 " if (! next)\n" +
8302 " next->top_allocated = (char *) base_reserved;\n" +
8303 " next->top_committed = (char *) base_reserved;\n" +
8304 " next->top_reserved = (char *) base_reserved + reserve_size;\n" +
8305 " next->reserve_size = reserve_size;\n" +
8306 " next->previous = *last;\n" +
8307 " *last = next;\n" +
