Searched refs:next_free (Results 1 - 3 of 3) sorted by last modified time

/haiku/src/system/kernel/debug/
H A Ddebug_heap.cpp32 uint32 next_free; member in struct:free_entry
99 index = ((free_entry*)&fBase[index])->next_free;
174 next = ((free_entry*)&fBase[next])->next_free;
187 ((free_entry*)&fBase[previous])->next_free = index;
192 ((free_entry*)&fBase[index])->next_free = next;
200 uint32 next = ((free_entry*)&fBase[index])->next_free;
203 ((free_entry*)&fBase[previous])->next_free = next;
/haiku/src/system/libroot/posix/glibc/extensions/
H A Dobstack.c204 h->next_free = h->object_base = chunk->contents;
264 h->next_free = h->object_base = chunk->contents;
288 register long obj_size = h->next_free - h->object_base;
341 h->next_free = h->object_base + obj_size;
410 h->object_base = h->next_free = (char *) (obj);
448 h->object_base = h->next_free = (char *) (obj);
H A Dobstack.h170 char *next_free; /* where to add next char to current object */
287 #define obstack_next_free(h) ((h)->next_free)
353 #define obstack_1grow_fast(h,achar) (*((h)->next_free)++ = achar)
355 #define obstack_blank_fast(h,n) ((h)->next_free += (n))
376 (unsigned) (__o->next_free - __o->object_base); })
381 (unsigned) (__o->chunk_limit - __o->next_free); })
387 if (__o->chunk_limit - __o->next_free < __len) \
394 (__o->chunk->prev == 0 && __o->next_free - __o->chunk->contents == 0); })
400 if (__o->next_free + __len > __o->chunk_limit) \
402 _obstack_memcpy (__o->next_free, (wher
169 char *next_free; /* where to add next char to current object */ member in struct:obstack
[all...]

Completed in 66 milliseconds