Lines Matching defs:chunk
135 /* Initialize an obstack H for use. Specify chunk size SIZE (0 means default).
149 register struct _obstack_chunk *chunk; /* points to new chunk */
176 chunk = h->chunk = CALL_CHUNKFUN (h, h -> chunk_size);
177 if (!chunk)
179 h->next_free = h->object_base = __PTR_ALIGN ((char *) chunk, chunk->contents,
181 h->chunk_limit = chunk->limit
182 = (char *) chunk + h->chunk_size;
183 chunk->prev = 0;
184 /* The initial chunk now contains no empty object. */
196 register struct _obstack_chunk *chunk; /* points to new chunk */
224 chunk = h->chunk = CALL_CHUNKFUN (h, h -> chunk_size);
225 if (!chunk)
227 h->next_free = h->object_base = __PTR_ALIGN ((char *) chunk, chunk->contents,
229 h->chunk_limit = chunk->limit
230 = (char *) chunk + h->chunk_size;
231 chunk->prev = 0;
232 /* The initial chunk now contains no empty object. */
238 /* Allocate a new current chunk for the obstack *H
241 Copies any partial object from the end of the old chunk
247 register struct _obstack_chunk *old_chunk = h->chunk;
255 /* Compute size for new chunk. */
260 /* Allocate and initialize the new chunk. */
264 h->chunk = new_chunk;
268 /* Compute an aligned object_base in the new chunk */
272 /* Move the existing object to the new chunk.
293 free that chunk and remove it from the chain.
294 But not if that chunk might contain an empty object. */
306 /* The new chunk certainly contains no empty object yet. */
324 register struct _obstack_chunk *lp; /* below addr of any objects in this chunk */
325 register struct _obstack_chunk *plp; /* point to previous chunk if any */
327 lp = (h)->chunk;
329 the beginning of the chunk but might be an empty object exactly
330 at the end of an adjacent chunk. */
348 register struct _obstack_chunk *lp; /* below addr of any objects in this chunk */
349 register struct _obstack_chunk *plp; /* point to previous chunk if any */
351 lp = h->chunk;
352 /* We use >= because there cannot be an object at the beginning of a chunk.
354 at the end of another chunk. */
361 chunk contains an empty object, so assume that it may. */
368 h->chunk = lp;
388 for (lp = h->chunk; lp != 0; lp = lp->prev)