Lines Matching full:chunk
145 /* Initialize an obstack H for use. Specify chunk size SIZE (0 means default).
159 register struct _obstack_chunk *chunk; /* points to new chunk */
186 chunk = h->chunk = CALL_CHUNKFUN (h, h -> chunk_size);
187 if (!chunk)
189 h->next_free = h->object_base = __PTR_ALIGN ((char *) chunk, chunk->contents,
191 h->chunk_limit = chunk->limit
192 = (char *) chunk + h->chunk_size;
193 chunk->prev = 0;
194 /* The initial chunk now contains no empty object. */
206 register struct _obstack_chunk *chunk; /* points to new chunk */
234 chunk = h->chunk = CALL_CHUNKFUN (h, h -> chunk_size);
235 if (!chunk)
237 h->next_free = h->object_base = __PTR_ALIGN ((char *) chunk, chunk->contents,
239 h->chunk_limit = chunk->limit
240 = (char *) chunk + h->chunk_size;
241 chunk->prev = 0;
242 /* The initial chunk now contains no empty object. */
248 /* Allocate a new current chunk for the obstack *H
251 Copies any partial object from the end of the old chunk
257 register struct _obstack_chunk *old_chunk = h->chunk;
265 /* Compute size for new chunk. */
270 /* Allocate and initialize the new chunk. */
274 h->chunk = new_chunk;
278 /* Compute an aligned object_base in the new chunk */
282 /* Move the existing object to the new chunk.
303 free that chunk and remove it from the chain.
304 But not if that chunk might contain an empty object. */
316 /* The new chunk certainly contains no empty object yet. */
334 register struct _obstack_chunk *lp; /* below addr of any objects in this chunk */
335 register struct _obstack_chunk *plp; /* point to previous chunk if any */
337 lp = (h)->chunk;
339 the beginning of the chunk but might be an empty object exactly
340 at the end of an adjacent chunk. */
358 register struct _obstack_chunk *lp; /* below addr of any objects in this chunk */
359 register struct _obstack_chunk *plp; /* point to previous chunk if any */
361 lp = h->chunk;
362 /* We use >= because there cannot be an object at the beginning of a chunk.
364 at the end of another chunk. */
371 chunk contains an empty object, so assume that it may. */
378 h->chunk = lp;
398 for (lp = h->chunk; lp != 0; lp = lp->prev)
