Lines Matching defs:chunk

148 /* Initialize an obstack H for use.  Specify chunk size SIZE (0 means default).
169 register struct _obstack_chunk *chunk; /* points to new chunk */
201 chunk = h->chunk = CALL_CHUNKFUN (h, h -> chunk_size);
202 if (!chunk)
204 h->next_free = h->object_base = chunk->contents;
205 h->chunk_limit = chunk->limit
206 = (char *) chunk + h->chunk_size;
207 chunk->prev = 0;
208 /* The initial chunk now contains no empty object. */
228 register struct _obstack_chunk *chunk; /* points to new chunk */
261 chunk = h->chunk = CALL_CHUNKFUN (h, h -> chunk_size);
262 if (!chunk)
264 h->next_free = h->object_base = chunk->contents;
265 h->chunk_limit = chunk->limit
266 = (char *) chunk + h->chunk_size;
267 chunk->prev = 0;
268 /* The initial chunk now contains no empty object. */
274 /* Allocate a new current chunk for the obstack *H
277 Copies any partial object from the end of the old chunk
285 register struct _obstack_chunk *old_chunk = h->chunk;
293 /* Compute size for new chunk. */
298 /* Allocate and initialize the new chunk. */
302 h->chunk = new_chunk;
306 /* Compute an aligned object_base in the new chunk */
311 /* Move the existing object to the new chunk.
332 free that chunk and remove it from the chain.
333 But not if that chunk might contain an empty object. */
342 /* The new chunk certainly contains no empty object yet. */
364 register struct _obstack_chunk *lp; /* below addr of any objects in this chunk */
365 register struct _obstack_chunk *plp; /* point to previous chunk if any */
367 lp = (h)->chunk;
369 the beginning of the chunk but might be an empty object exactly
370 at the end of an adjacent chunk. */
392 register struct _obstack_chunk *lp; /* below addr of any objects in this chunk */
393 register struct _obstack_chunk *plp; /* point to previous chunk if any */
395 lp = h->chunk;
396 /* We use >= because there cannot be an object at the beginning of a chunk.
398 at the end of another chunk. */
405 chunk contains an empty object, so assume that it may. */
412 h->chunk = lp;
430 register struct _obstack_chunk *lp; /* below addr of any objects in this chunk */
431 register struct _obstack_chunk *plp; /* point to previous chunk if any */
433 lp = h->chunk;
434 /* We use >= because there cannot be an object at the beginning of a chunk.
436 at the end of another chunk. */
443 chunk contains an empty object, so assume that it may. */
450 h->chunk = lp;
465 for (lp = h->chunk; lp != 0; lp = lp->prev)