usr.bin/grep/obstack.c

143 /* Initialize an obstack H for use.  Specify chunk size SIZE (0 means default).
164   register struct _obstack_chunk *chunk; /* points to new chunk */
196   chunk = h->chunk = CALL_CHUNKFUN (h, h -> chunk_size);
197   if (!chunk)
199   h->next_free = h->object_base = chunk->contents;
200   h->chunk_limit = chunk->limit
201     = (char *) chunk + h->chunk_size;
202   chunk->prev = 0;
203   /* The initial chunk now contains no empty object.  */
223   register struct _obstack_chunk *chunk; /* points to new chunk */
256   chunk = h->chunk = CALL_CHUNKFUN (h, h -> chunk_size);
257   if (!chunk)
259   h->next_free = h->object_base = chunk->contents;
260   h->chunk_limit = chunk->limit
261     = (char *) chunk + h->chunk_size;
262   chunk->prev = 0;
263   /* The initial chunk now contains no empty object.  */
269 /* Allocate a new current chunk for the obstack *H
272    Copies any partial object from the end of the old chunk
280   register struct _obstack_chunk *old_chunk = h->chunk;
287   /* Compute size for new chunk.  */
292   /* Allocate and initialize the new chunk.  */
296   h->chunk = new_chunk;
300   /* Move the existing object to the new chunk.
321      free that chunk and remove it from the chain.
322      But not if that chunk might contain an empty object.  */
331   /* The new chunk certainly contains no empty object yet.  */
350   register struct _obstack_chunk *lp;	/* below addr of any objects in this chunk */
351   register struct _obstack_chunk *plp;	/* point to previous chunk if any */
353   lp = (h)->chunk;
355      the beginning of the chunk but might be an empty object exactly
356      at the end of an adjacent chunk.  */
379   register struct _obstack_chunk *lp;	/* below addr of any objects in this chunk */
380   register struct _obstack_chunk *plp;	/* point to previous chunk if any */
382   lp = h->chunk;
383   /* We use >= because there cannot be an object at the beginning of a chunk.
385      at the end of another chunk.  */
392 	 chunk contains an empty object, so assume that it may.  */
399       h->chunk = lp;
413   register struct _obstack_chunk *lp;	/* below addr of any objects in this chunk */
414   register struct _obstack_chunk *plp;	/* point to previous chunk if any */
416   lp = h->chunk;
417   /* We use >= because there cannot be an object at the beginning of a chunk.
419      at the end of another chunk.  */
426 	 chunk contains an empty object, so assume that it may.  */
433       h->chunk = lp;
448   for (lp = h->chunk; lp != 0; lp = lp->prev)