Lines Matching refs:chunk
133 /* Initialize an obstack H for use. Specify chunk size SIZE (0 means default).
147 register struct _obstack_chunk *chunk; /* points to new chunk */
174 chunk = h->chunk = CALL_CHUNKFUN (h, h -> chunk_size);
175 if (!chunk)
177 h->next_free = h->object_base = __PTR_ALIGN ((char *) chunk, chunk->contents,
179 h->chunk_limit = chunk->limit
180 = (char *) chunk + h->chunk_size;
181 chunk->prev = 0;
182 /* The initial chunk now contains no empty object. */
194 register struct _obstack_chunk *chunk; /* points to new chunk */
222 chunk = h->chunk = CALL_CHUNKFUN (h, h -> chunk_size);
223 if (!chunk)
225 h->next_free = h->object_base = __PTR_ALIGN ((char *) chunk, chunk->contents,
227 h->chunk_limit = chunk->limit
228 = (char *) chunk + h->chunk_size;
229 chunk->prev = 0;
230 /* The initial chunk now contains no empty object. */
236 /* Allocate a new current chunk for the obstack *H
239 Copies any partial object from the end of the old chunk
245 register struct _obstack_chunk *old_chunk = h->chunk;
253 /* Compute size for new chunk. */
258 /* Allocate and initialize the new chunk. */
262 h->chunk = new_chunk;
266 /* Compute an aligned object_base in the new chunk */
270 /* Move the existing object to the new chunk.
291 free that chunk and remove it from the chain.
292 But not if that chunk might contain an empty object. */
304 /* The new chunk certainly contains no empty object yet. */
322 register struct _obstack_chunk *lp; /* below addr of any objects in this chunk */
323 register struct _obstack_chunk *plp; /* point to previous chunk if any */
325 lp = (h)->chunk;
327 the beginning of the chunk but might be an empty object exactly
328 at the end of an adjacent chunk. */
346 register struct _obstack_chunk *lp; /* below addr of any objects in this chunk */
347 register struct _obstack_chunk *plp; /* point to previous chunk if any */
349 lp = h->chunk;
350 /* We use >= because there cannot be an object at the beginning of a chunk.
352 at the end of another chunk. */
359 chunk contains an empty object, so assume that it may. */
366 h->chunk = lp;
386 for (lp = h->chunk; lp != 0; lp = lp->prev)
