Lines Matching refs:objects

5 An @dfn{obstack} is a pool of memory containing a stack of objects.  You
6 can create any number of separate obstacks, and then allocate objects in
12 general: an obstack can contain any number of objects of any size.  They
14 the objects are usually small.  And the only space overhead per object is
21 * Allocation in an Obstack::    Allocating objects in an obstack.
22 * Freeing Obstack Objects::     Freeing objects in an obstack.
27 				 complicated) growing objects.
29 * Obstacks Data Alignment::     Controlling alignment of objects in obstacks.
47 of the obstack and how to find the space in which objects are allocated.
48 It does not contain any of the objects themselves.  You should not try
64 The objects in the obstack are packed into large blocks called
91 the chunks of memory into which objects are packed.  The other,
92 @code{obstack_chunk_free}, is used to return chunks when the objects in
117 Initialize obstack @var{obstack-ptr} for allocation of objects.  This
240 @code{obstack_free}.  Since the obstack is a stack of objects, freeing
241 one object automatically frees all other objects allocated more recently
262 Recall that the objects in an obstack are grouped into chunks.  When all
263 the objects in a chunk become free, the obstack library automatically
325 @cindex growing objects (in obstacks)
332 this the technique of @dfn{growing objects}.  The special functions
432 @cindex shrinking objects
441 The usual functions for growing objects incur overhead for checking
443 are frequently constructing objects in small steps of growth, this
602 that allows aligned objects to hold any type of data: for example, if
634 for storing objects.  Regardless of the specified size, longer chunks
635 will be allocated when necessary for long objects.
639 longer needed because you have freed all the objects in it, the obstack
673 allocating many objects whose size is comparable to the chunk size.  Here