Home
last modified time | relevance | path

Searched refs:next_free (Results 1 – 3 of 3) sorted by relevance

/external/bison/lib/
Dobstack.h155 char *next_free; /* where to add next char to current object */ member
213 #define obstack_next_free(h) ((h)->next_free)
246 #define obstack_1grow_fast(h,achar) (*((h)->next_free)++ = (achar))
248 #define obstack_blank_fast(h,n) ((h)->next_free += (n))
268 (unsigned) (__o->next_free - __o->object_base); })
273 (unsigned) (__o->chunk_limit - __o->next_free); })
279 if (__o->chunk_limit - __o->next_free < __len) \
287 && __o->next_free == __PTR_ALIGN ((char *) __o->chunk, \
295 if (__o->next_free + __len > __o->chunk_limit) \
297 memcpy (__o->next_free, where, __len); \
[all …]
Dobstack.c188 h->next_free = h->object_base = __PTR_ALIGN ((char *) chunk, chunk->contents, in _obstack_begin()
236 h->next_free = h->object_base = __PTR_ALIGN ((char *) chunk, chunk->contents, in _obstack_begin_1()
259 register long obj_size = h->next_free - h->object_base; in _obstack_newchunk()
314 h->next_free = h->object_base + obj_size; in _obstack_newchunk()
374 h->object_base = h->next_free = (char *) (obj); in obstack_free()
/external/dosfstools/src/
Dcheck.c156 int next_free = 0, scan; in alloc_rootdir_entry() local
161 while (next_free < fs->root_entries) in alloc_rootdir_entry()
162 if (IS_FREE(root[next_free].name) && in alloc_rootdir_entry()
163 root[next_free].attr != VFAT_LN_ATTR) in alloc_rootdir_entry()
165 else next_free++; in alloc_rootdir_entry()
166 if (next_free == fs->root_entries) in alloc_rootdir_entry()
168 offset = fs->root_start+next_free*sizeof(DIR_ENT); in alloc_rootdir_entry()
173 if (scan != next_free && in alloc_rootdir_entry()