The libiberty
library is a collection of subroutines used by various
GNU programs. It is available under the Library General Public
License; for more information, see Library Copying.
This edition accompanies GCC 3, September 2001.
To date, libiberty
is generally not installed on its own. It has evolved
over years but does not have its own version number nor release schedule.
Possibly the easiest way to use libiberty
in your projects is to drop the
libiberty
code into your project's sources, and to build the library along
with your own sources; the library would then be linked in at the end. This
prevents any possible version mismatches with other copies of libiberty
elsewhere on the system.
Passing --enable-install-libiberty
to the configure
script when building libiberty
causes the header files and archive library
to be installed when make install is run. This option also takes
an (optional) argument to specify the installation location, in the same
manner as --prefix
.
For your own projects, an approach which offers stability and flexibility
is to include libiberty
with your code, but allow the end user to optionally
choose to use a previously-installed version instead. In this way the
user may choose (for example) to install libiberty
as part of GCC, and use
that version for all software built with that compiler. (This approach
has proven useful with software using the GNU readline
library.)
Making use of libiberty
code usually requires that you include one or more
header files from the libiberty
distribution. (They will be named as
necessary in the function descriptions.) At link time, you will need to
add -liberty
to your link command invocation.
Functions contained in libiberty
can be divided into three general categories.
Certain operating systems do not provide functions which have since
become standardized, or at least common. For example, the Single
Unix Specification Version 2 requires that the basename
function be provided, but an OS which predates that specification
might not have this function. This should not prevent well-written
code from running on such a system.
Similarly, some functions exist only among a particular "flavor"
or "family" of operating systems. As an example, the bzero
function is often not present on systems outside the BSD-derived
family of systems.
Many such functions are provided in libiberty
. They are quickly
listed here with little description, as systems which lack them
become less and less common. Each function foo is implemented
in foo
.c
but not declared in any libiberty
header file; more
comments and caveats for each function's implementation are often
available in the source file. Generally, the function can simply
be declared as extern
.
Some functions have extremely limited implementations on different
platforms. Other functions are tedious to use correctly; for example,
proper use of malloc
calls for the return value to be checked and
appropriate action taken if memory has been exhausted. A group of
"replacement functions" is available in libiberty
to address these issues
for some of the most commonly used subroutines.
All of these functions are declared in the libiberty.h
header
file. Many of the implementations will use preprocessor macros set by
GNU Autoconf, if you decide to make use of that program. Some of these
functions may call one another.
The functions beginning with the letter x
are wrappers around
standard functions; the functions provided by the system environment
are called and their results checked before the results are passed back
to client code. If the standard functions fail, these wrappers will
terminate the program. Thus, these versions can be used with impunity.
The existence and implementation of the atexit
routine varies
amongst the flavors of Unix. libiberty
provides an unvarying dependable
implementation via xatexit
and xexit
.
These are a set of routines to facilitate programming with the system
errno
interface. The libiberty
source file strerror.c
contains a good deal of documentation for these functions.
libiberty
includes additional functionality above and beyond standard
functions, which has proven generically useful in GNU programs, such as
obstacks and regex. These functions are often copied from other
projects as they gain popularity, and are included here to provide a
central location from which to use, maintain, and distribute them.
An obstack is a pool of memory containing a stack of objects. You can create any number of separate obstacks, and then allocate objects in specified obstacks. Within each obstack, the last object allocated must always be the first one freed, but distinct obstacks are independent of each other.
Aside from this one constraint of order of freeing, obstacks are totally general: an obstack can contain any number of objects of any size. They are implemented with macros, so allocation is usually very fast as long as the objects are usually small. And the only space overhead per object is the padding needed to start each object on a suitable boundary.
The utilities for manipulating obstacks are declared in the header
file obstack.h
.
struct obstack | Data Type |
An obstack is represented by a data structure of type struct
obstack . This structure has a small fixed size; it records the status
of the obstack and how to find the space in which objects are allocated.
It does not contain any of the objects themselves. You should not try
to access the contents of the structure directly; use only the functions
described in this chapter.
|
You can declare variables of type struct obstack
and use them as
obstacks, or you can allocate obstacks dynamically like any other kind
of object. Dynamic allocation of obstacks allows your program to have a
variable number of different stacks. (You can even allocate an
obstack structure in another obstack, but this is rarely useful.)
All the functions that work with obstacks require you to specify which
obstack to use. You do this with a pointer of type struct obstack
*
. In the following, we often say "an obstack" when strictly
speaking the object at hand is such a pointer.
The objects in the obstack are packed into large blocks called
chunks. The struct obstack
structure points to a chain of
the chunks currently in use.
The obstack library obtains a new chunk whenever you allocate an object
that won't fit in the previous chunk. Since the obstack library manages
chunks automatically, you don't need to pay much attention to them, but
you do need to supply a function which the obstack library should use to
get a chunk. Usually you supply a function which uses malloc
directly or indirectly. You must also supply a function to free a chunk.
These matters are described in the following section.
Each source file in which you plan to use the obstack functions
must include the header file obstack.h
, like this:
#include <obstack.h>
Also, if the source file uses the macro obstack_init
, it must
declare or define two functions or macros that will be called by the
obstack library. One, obstack_chunk_alloc
, is used to allocate
the chunks of memory into which objects are packed. The other,
obstack_chunk_free
, is used to return chunks when the objects in
them are freed. These macros should appear before any use of obstacks
in the source file.
Usually these are defined to use malloc
via the intermediary
xmalloc
(see Unconstrained Allocation). This is done with
the following pair of macro definitions:
#define obstack_chunk_alloc xmalloc #define obstack_chunk_free free
Though the memory you get using obstacks really comes from malloc
,
using obstacks is faster because malloc
is called less often, for
larger blocks of memory. See Obstack Chunks, for full details.
At run time, before the program can use a struct obstack
object
as an obstack, it must initialize the obstack by calling
obstack_init
.
int obstack_init (struct obstack *obstack-ptr) | Function |
Initialize obstack obstack-ptr for allocation of objects. This
function calls the obstack's obstack_chunk_alloc function. If
allocation of memory fails, the function pointed to by
obstack_alloc_failed_handler is called. The obstack_init
function always returns 1 (Compatibility notice: Former versions of
obstack returned 0 if allocation failed).
|
Here are two examples of how to allocate the space for an obstack and initialize it. First, an obstack that is a static variable:
static struct obstack myobstack; ... obstack_init (&myobstack);
Second, an obstack that is itself dynamically allocated:
struct obstack *myobstack_ptr = (struct obstack *) xmalloc (sizeof (struct obstack)); obstack_init (myobstack_ptr);
obstack_alloc_failed_handler | Variable |
The value of this variable is a pointer to a function that
obstack uses when obstack_chunk_alloc fails to allocate
memory. The default action is to print a message and abort.
You should supply a function that either calls exit
(see Program Termination) or longjmp (see Non-Local Exits) and doesn't return.
void my_obstack_alloc_failed (void) ... obstack_alloc_failed_handler = &my_obstack_alloc_failed; |
The most direct way to allocate an object in an obstack is with
obstack_alloc
, which is invoked almost like malloc
.
void * obstack_alloc (struct obstack *obstack-ptr, int size) | Function |
This allocates an uninitialized block of size bytes in an obstack
and returns its address. Here obstack-ptr specifies which obstack
to allocate the block in; it is the address of the struct obstack
object which represents the obstack. Each obstack function or macro
requires you to specify an obstack-ptr as the first argument.
This function calls the obstack's |
For example, here is a function that allocates a copy of a string str
in a specific obstack, which is in the variable string_obstack
:
struct obstack string_obstack; char * copystring (char *string) { size_t len = strlen (string) + 1; char *s = (char *) obstack_alloc (&string_obstack, len); memcpy (s, string, len); return s; }
To allocate a block with specified contents, use the function
obstack_copy
, declared like this:
void * obstack_copy (struct obstack *obstack-ptr, void *address, int size) | Function |
This allocates a block and initializes it by copying size
bytes of data starting at address. It calls
obstack_alloc_failed_handler if allocation of memory by
obstack_chunk_alloc failed.
|
void * obstack_copy0 (struct obstack *obstack-ptr, void *address, int size) | Function |
Like obstack_copy , but appends an extra byte containing a null
character. This extra byte is not counted in the argument size.
|
The obstack_copy0
function is convenient for copying a sequence
of characters into an obstack as a null-terminated string. Here is an
example of its use:
char * obstack_savestring (char *addr, int size) { return obstack_copy0 (&myobstack, addr, size); }
Contrast this with the previous example of savestring
using
malloc
(see Basic Allocation).
To free an object allocated in an obstack, use the function
obstack_free
. Since the obstack is a stack of objects, freeing
one object automatically frees all other objects allocated more recently
in the same obstack.
void obstack_free (struct obstack *obstack-ptr, void *object) | Function |
If object is a null pointer, everything allocated in the obstack is freed. Otherwise, object must be the address of an object allocated in the obstack. Then object is freed, along with everything allocated in obstack since object. |
Note that if object is a null pointer, the result is an
uninitialized obstack. To free all memory in an obstack but leave it
valid for further allocation, call obstack_free
with the address
of the first object allocated on the obstack:
obstack_free (obstack_ptr, first_object_allocated_ptr);
Recall that the objects in an obstack are grouped into chunks. When all the objects in a chunk become free, the obstack library automatically frees the chunk (see Preparing for Obstacks). Then other obstacks, or non-obstack allocation, can reuse the space of the chunk.
The interfaces for using obstacks may be defined either as functions or as macros, depending on the compiler. The obstack facility works with all C compilers, including both ISO C and traditional C, but there are precautions you must take if you plan to use compilers other than GNU C.
If you are using an old-fashioned non-ISO C compiler, all the obstack "functions" are actually defined only as macros. You can call these macros like functions, but you cannot use them in any other way (for example, you cannot take their address).
Calling the macros requires a special precaution: namely, the first operand (the obstack pointer) may not contain any side effects, because it may be computed more than once. For example, if you write this:
obstack_alloc (get_obstack (), 4);
you will find that get_obstack
may be called several times.
If you use *obstack_list_ptr++
as the obstack pointer argument,
you will get very strange results since the incrementation may occur
several times.
In ISO C, each function has both a macro definition and a function definition. The function definition is used if you take the address of the function without calling it. An ordinary call uses the macro definition by default, but you can request the function definition instead by writing the function name in parentheses, as shown here:
char *x; void *(*funcp) (); /* Use the macro. */ x = (char *) obstack_alloc (obptr, size); /* Call the function. */ x = (char *) (obstack_alloc) (obptr, size); /* Take the address of the function. */ funcp = obstack_alloc;
This is the same situation that exists in ISO C for the standard library functions. See Macro Definitions.
Warning: When you do use the macros, you must observe the precaution of avoiding side effects in the first operand, even in ISO C.
If you use the GNU C compiler, this precaution is not necessary, because various language extensions in GNU C permit defining the macros so as to compute each argument only once.
Because memory in obstack chunks is used sequentially, it is possible to build up an object step by step, adding one or more bytes at a time to the end of the object. With this technique, you do not need to know how much data you will put in the object until you come to the end of it. We call this the technique of growing objects. The special functions for adding data to the growing object are described in this section.
You don't need to do anything special when you start to grow an object.
Using one of the functions to add data to the object automatically
starts it. However, it is necessary to say explicitly when the object is
finished. This is done with the function obstack_finish
.
The actual address of the object thus built up is not known until the object is finished. Until then, it always remains possible that you will add so much data that the object must be copied into a new chunk.
While the obstack is in use for a growing object, you cannot use it for ordinary allocation of another object. If you try to do so, the space already added to the growing object will become part of the other object.
void obstack_blank (struct obstack *obstack-ptr, int size) | Function |
The most basic function for adding to a growing object is
obstack_blank , which adds space without initializing it.
|
void obstack_grow (struct obstack *obstack-ptr, void *data, int size) | Function |
To add a block of initialized space, use obstack_grow , which is
the growing-object analogue of obstack_copy . It adds size
bytes of data to the growing object, copying the contents from
data.
|
void obstack_grow0 (struct obstack *obstack-ptr, void *data, int size) | Function |
This is the growing-object analogue of obstack_copy0 . It adds
size bytes copied from data, followed by an additional null
character.
|
void obstack_1grow (struct obstack *obstack-ptr, char c) | Function |
To add one character at a time, use the function obstack_1grow .
It adds a single byte containing c to the growing object.
|
void obstack_ptr_grow (struct obstack *obstack-ptr, void *data) | Function |
Adding the value of a pointer one can use the function
obstack_ptr_grow . It adds sizeof (void *) bytes
containing the value of data.
|
void obstack_int_grow (struct obstack *obstack-ptr, int data) | Function |
A single value of type int can be added by using the
obstack_int_grow function. It adds sizeof (int) bytes to
the growing object and initializes them with the value of data.
|
void * obstack_finish (struct obstack *obstack-ptr) | Function |
When you are finished growing the object, use the function
obstack_finish to close it off and return its final address.
Once you have finished the object, the obstack is available for ordinary allocation or for growing another object. This function can return a null pointer under the same conditions as
|
When you build an object by growing it, you will probably need to know
afterward how long it became. You need not keep track of this as you grow
the object, because you can find out the length from the obstack just
before finishing the object with the function obstack_object_size
,
declared as follows:
int obstack_object_size (struct obstack *obstack-ptr) | Function |
This function returns the current size of the growing object, in bytes.
Remember to call this function before finishing the object.
After it is finished, obstack_object_size will return zero.
|
If you have started growing an object and wish to cancel it, you should finish it and then free it, like this:
obstack_free (obstack_ptr, obstack_finish (obstack_ptr));
This has no effect if no object was growing.
You can use obstack_blank
with a negative size argument to make
the current object smaller. Just don't try to shrink it beyond zero
length--there's no telling what will happen if you do that.
The usual functions for growing objects incur overhead for checking whether there is room for the new growth in the current chunk. If you are frequently constructing objects in small steps of growth, this overhead can be significant.
You can reduce the overhead by using special "fast growth" functions that grow the object without checking. In order to have a robust program, you must do the checking yourself. If you do this checking in the simplest way each time you are about to add data to the object, you have not saved anything, because that is what the ordinary growth functions do. But if you can arrange to check less often, or check more efficiently, then you make the program faster.
The function obstack_room
returns the amount of room available
in the current chunk. It is declared as follows:
int obstack_room (struct obstack *obstack-ptr) | Function |
This returns the number of bytes that can be added safely to the current growing object (or to an object about to be started) in obstack obstack using the fast growth functions. |
While you know there is room, you can use these fast growth functions for adding data to a growing object:
void obstack_1grow_fast (struct obstack *obstack-ptr, char c) | Function |
The function obstack_1grow_fast adds one byte containing the
character c to the growing object in obstack obstack-ptr.
|
void obstack_ptr_grow_fast (struct obstack *obstack-ptr, void *data) | Function |
The function obstack_ptr_grow_fast adds sizeof (void *)
bytes containing the value of data to the growing object in
obstack obstack-ptr.
|
void obstack_int_grow_fast (struct obstack *obstack-ptr, int data) | Function |
The function obstack_int_grow_fast adds sizeof (int) bytes
containing the value of data to the growing object in obstack
obstack-ptr.
|
void obstack_blank_fast (struct obstack *obstack-ptr, int size) | Function |
The function obstack_blank_fast adds size bytes to the
growing object in obstack obstack-ptr without initializing them.
|
When you check for space using obstack_room
and there is not
enough room for what you want to add, the fast growth functions
are not safe. In this case, simply use the corresponding ordinary
growth function instead. Very soon this will copy the object to a
new chunk; then there will be lots of room available again.
So, each time you use an ordinary growth function, check afterward for
sufficient space using obstack_room
. Once the object is copied
to a new chunk, there will be plenty of space again, so the program will
start using the fast growth functions again.
Here is an example:
void add_string (struct obstack *obstack, const char *ptr, int len) { while (len > 0) { int room = obstack_room (obstack); if (room == 0) { /* Not enough room. Add one character slowly, which may copy to a new chunk and make room. */ obstack_1grow (obstack, *ptr++); len--; } else { if (room > len) room = len; /* Add fast as much as we have room for. */ len -= room; while (room-- > 0) obstack_1grow_fast (obstack, *ptr++); } } }
Here are functions that provide information on the current status of allocation in an obstack. You can use them to learn about an object while still growing it.
void * obstack_base (struct obstack *obstack-ptr) | Function |
This function returns the tentative address of the beginning of the
currently growing object in obstack-ptr. If you finish the object
immediately, it will have that address. If you make it larger first, it
may outgrow the current chunk--then its address will change!
If no object is growing, this value says where the next object you allocate will start (once again assuming it fits in the current chunk). |
void * obstack_next_free (struct obstack *obstack-ptr) | Function |
This function returns the address of the first free byte in the current
chunk of obstack obstack-ptr. This is the end of the currently
growing object. If no object is growing, obstack_next_free
returns the same value as obstack_base .
|
int obstack_object_size (struct obstack *obstack-ptr) | Function |
This function returns the size in bytes of the currently growing object.
This is equivalent to
obstack_next_free (obstack-ptr) - obstack_base (obstack-ptr) |
Each obstack has an alignment boundary; each object allocated in the obstack automatically starts on an address that is a multiple of the specified boundary. By default, this boundary is 4 bytes.
To access an obstack's alignment boundary, use the macro
obstack_alignment_mask
, whose function prototype looks like
this:
int obstack_alignment_mask (struct obstack *obstack-ptr) | Macro |
The value is a bit mask; a bit that is 1 indicates that the corresponding
bit in the address of an object should be 0. The mask value should be one
less than a power of 2; the effect is that all object addresses are
multiples of that power of 2. The default value of the mask is 3, so that
addresses are multiples of 4. A mask value of 0 means an object can start
on any multiple of 1 (that is, no alignment is required).
The expansion of the macro obstack_alignment_mask (obstack_ptr) = 0; has the effect of turning off alignment processing in the specified obstack. |
Note that a change in alignment mask does not take effect until
after the next time an object is allocated or finished in the
obstack. If you are not growing an object, you can make the new
alignment mask take effect immediately by calling obstack_finish
.
This will finish a zero-length object and then do proper alignment for
the next object.
Obstacks work by allocating space for themselves in large chunks, and then parceling out space in the chunks to satisfy your requests. Chunks are normally 4096 bytes long unless you specify a different chunk size. The chunk size includes 8 bytes of overhead that are not actually used for storing objects. Regardless of the specified size, longer chunks will be allocated when necessary for long objects.
The obstack library allocates chunks by calling the function
obstack_chunk_alloc
, which you must define. When a chunk is no
longer needed because you have freed all the objects in it, the obstack
library frees the chunk by calling obstack_chunk_free
, which you
must also define.
These two must be defined (as macros) or declared (as functions) in each
source file that uses obstack_init
(see Creating Obstacks).
Most often they are defined as macros like this:
#define obstack_chunk_alloc malloc #define obstack_chunk_free free
Note that these are simple macros (no arguments). Macro definitions with
arguments will not work! It is necessary that obstack_chunk_alloc
or obstack_chunk_free
, alone, expand into a function name if it is
not itself a function name.
If you allocate chunks with malloc
, the chunk size should be a
power of 2. The default chunk size, 4096, was chosen because it is long
enough to satisfy many typical requests on the obstack yet short enough
not to waste too much memory in the portion of the last chunk not yet used.
int obstack_chunk_size (struct obstack *obstack-ptr) | Macro |
This returns the chunk size of the given obstack. |
Since this macro expands to an lvalue, you can specify a new chunk size by assigning it a new value. Doing so does not affect the chunks already allocated, but will change the size of chunks allocated for that particular obstack in the future. It is unlikely to be useful to make the chunk size smaller, but making it larger might improve efficiency if you are allocating many objects whose size is comparable to the chunk size. Here is how to do so cleanly:
if (obstack_chunk_size (obstack_ptr) < new-chunk-size) obstack_chunk_size (obstack_ptr) = new-chunk-size;
Here is a summary of all the functions associated with obstacks. Each
takes the address of an obstack (struct obstack *
) as its first
argument.
void obstack_init (struct obstack *
obstack-ptr)
void *obstack_alloc (struct obstack *
obstack-ptr, int
size)
void *obstack_copy (struct obstack *
obstack-ptr, void *
address, int
size)
void *obstack_copy0 (struct obstack *
obstack-ptr, void *
address, int
size)
void obstack_free (struct obstack *
obstack-ptr, void *
object)
void obstack_blank (struct obstack *
obstack-ptr, int
size)
void obstack_grow (struct obstack *
obstack-ptr, void *
address, int
size)
void obstack_grow0 (struct obstack *
obstack-ptr, void *
address, int
size)
void obstack_1grow (struct obstack *
obstack-ptr, char
data-char)
void *obstack_finish (struct obstack *
obstack-ptr)
int obstack_object_size (struct obstack *
obstack-ptr)
void obstack_blank_fast (struct obstack *
obstack-ptr, int
size)
void obstack_1grow_fast (struct obstack *
obstack-ptr, char
data-char)
int obstack_room (struct obstack *
obstack-ptr)
int obstack_alignment_mask (struct obstack *
obstack-ptr)
int obstack_chunk_size (struct obstack *
obstack-ptr)
void *obstack_base (struct obstack *
obstack-ptr)
void *obstack_next_free (struct obstack *
obstack-ptr)
void* alloca (size_t size) | Replacement |
This function allocates memory which will be automatically reclaimed
after the procedure exits. The The header file |
int asprintf (char **resptr, const char *format, ...) | Extension |
Like |
int atexit (void (*f)()) | Supplemental |
Causes function f to be called at exit. Returns 0. |
char* basename (const char *name) | Supplemental |
Returns a pointer to the last component of pathname name. Behavior is undefined if the pathname ends in a directory separator. |
int bcmp (char *x, char *y, int count) | Supplemental |
Compares the first count bytes of two areas of memory. Returns zero if they are the same, nonzero otherwise. Returns zero if count is zero. A nonzero result only indicates a difference, it does not indicate any sorting order (say, by having a positive result mean x sorts before y). |
void bcopy (char *in, char *out, int length) | Supplemental |
Copies length bytes from memory region in to region
out. The use of |
void* bsearch (const void *key, const void *base, size_t nmemb, size_t size, int (*compar)(const void *, const void *)) | Supplemental |
Performs a search over an array of nmemb elements pointed to by base for a member that matches the object pointed to by key. The size of each member is specified by size. The array contents should be sorted in ascending order according to the compar comparison function. This routine should take two arguments pointing to the key and to an array member, in that order, and should return an integer less than, equal to, or greater than zero if the key object is respectively less than, matching, or greater than the array member. |
char** buildargv (char *sp) | Extension |
Given a pointer to a string, parse the string extracting fields
separated by whitespace and optionally enclosed within either single
or double quotes (which are stripped off), and build a vector of
pointers to copies of the string for each field. The input string
remains unchanged. The last element of the vector is followed by a
All of the memory for the pointer array and copies of the string
is obtained from Returns a pointer to the argument vector if successful. Returns
If the input is a null string (as opposed to a |
void bzero (char *mem, int count) | Supplemental |
Zeros count bytes starting at mem. Use of this function
is deprecated in favor of |
void* calloc (size_t nelem, size_t elsize) | Supplemental |
Uses |
char* choose_temp_base (void) | Extension |
Return a prefix for temporary file names or This function is provided for backwards compatability only. Its use is not recommended. |
char* choose_tmpdir () | Replacement |
Returns a pointer to a directory path suitable for creating temporary files in. |
long clock (void) | Supplemental |
Returns an approximation of the CPU time used by the process as a
|
char* concat (const char *s1, const char *s2, ..., NULL )
|
Extension |
Concatenate zero or more of strings and return the result in freshly
|
char** dupargv (char **vector) | Extension |
Duplicate an argument vector. Simply scans through vector,
duplicating each argument until the terminating |
int errno_max (void) | Extension |
Returns the maximum We return the maximum value that can be used to obtain a meaningful symbolic name or message. |
int fdmatch (int fd1, int fd2) | Extension |
Check to see if two open file descriptors refer to the same file.
This is useful, for example, when we have an open file descriptor for
an unnamed file, and the name of a file that we believe to correspond
to that fd. This can happen when we are exec'd with an already open
file ( |
int ffs (int valu) | Supplemental |
Find the first (least significant) bit set in valu. Bits are numbered from right to left, starting with bit 1 (corresponding to the value 1). If valu is zero, zero is returned. |
int fnmatch (const char *pattern, const char *string, int flags) | Replacement |
Matches string against pattern, returning zero if it
matches,
|
void freeargv (char **vector) | Extension |
Free an argument vector that was built using |
long get_run_time (void) | Replacement |
Returns the time used so far, in microseconds. If possible, this is the time used by this process, else it is the elapsed time since the process started. |
char* getcwd (char *pathname, int len) | Supplemental |
Copy the absolute pathname for the current working directory into
pathname, which is assumed to point to a buffer of at least
len bytes, and return a pointer to the buffer. If the current
directory's path doesn't fit in len characters, the result is
|
int getpagesize (void) | Supplemental |
Returns the number of bytes in a page of memory. This is the granularity of many of the system memory management routines. No guarantee is made as to whether or not it is the same as the basic memory management hardware page size. |
char* getpwd (void) | Supplemental |
Returns the current working directory. This implementation caches the
result on the assumption that the process will not call |
void hex_init (void) | Extension |
Initializes the array mapping the current character set to
corresponding hex values. This function must be called before any
call to |
int hex_p (int c) | Extension |
Evaluates to non-zero if the given character is a valid hex character,
or zero if it is not. Note that the value you pass will be cast to
|
int hex_value (int c) | Extension |
Returns the numeric equivalent of the given character when interpreted
as a hexidecimal digit. The result is undefined if you pass an
invalid hex digit. Note that the value you pass will be cast to
|
char* index (char *s, int c) | Supplemental |
Returns a pointer to the first occurrence of the character c in
the string s, or |
void insque (struct qelem *elem, struct qelem *pred) | Supplemental |
void remque (struct qelem *elem) | Supplemental |
Routines to manipulate queues built from doubly linked lists. The
struct qelem { struct qelem *q_forw; struct qelem *q_back; char q_data[]; }; |
const char* lbasename (const char *name) | Replacement |
Given a pointer to a string containing a typical pathname
( In particular, the empty string returns the same empty string,
and a path ending in |
const char* make_relative_prefix (const char *progname, const char *bin_prefix, const char *prefix) | Extension |
Given three strings progname, bin_prefix, prefix, return a string that gets to prefix starting with the directory portion of progname and a relative pathname of the difference between bin_prefix and prefix. For example, if bin_prefix is The return value is normally allocated via |
const char* lrealpath (const char *name) | Replacement |
Given a pointer to a string containing a pathname, returns a canonical
version of the filename. Symlinks will be resolved, and "." and ".."
components will be simplified. The returned value will be allocated using
|
const char* make_relative_prefix (const char *progname, const char *bin_prefix, const char *prefix) | Extension |
Given three paths progname, bin_prefix, prefix, return the path that is in the same position relative to progname's directory as prefix is relative to bin_prefix. That is, a string starting with the directory portion of progname, followed by a relative pathname of the difference between bin_prefix and prefix. If progname does not contain any directory separators,
For example, if bin_prefix is The return value is normally allocated via |
char* make_temp_file (const char *suffix) | Replacement |
Return a temporary file name (as a string) or |
void* memchr (const void *s, int c, size_t n) | Supplemental |
This function searches memory starting at |
int memcmp (const void *x, const void *y, size_t count) | Supplemental |
Compares the first count bytes of two areas of memory. Returns zero if they are the same, a value less than zero if x is lexically less than y, or a value greater than zero if x is lexically greater than y. Note that lexical order is determined as if comparing unsigned char arrays. |
void* memcpy (void *out, const void *in, size_t length) | Supplemental |
Copies length bytes from memory region in to region out. Returns a pointer to out. |
void* memmove (void *from, const void *to, size_t count) | Supplemental |
Copies count bytes from memory area from to memory area to, returning a pointer to to. |
void* memset (void *s, int c, size_t count) | Supplemental |
Sets the first count bytes of s to the constant byte c, returning a pointer to s. |
int mkstemps (char *template, int suffix_len) | Replacement |
Generate a unique temporary file name from template. template has the form: path/ccXXXXXXsuffix suffix_len tells us how long suffix is (it can be zero
length). The last six characters of template before suffix
must be |
int pexecute (const char *program, char * const *argv, const char *this_pname, const char *temp_base, char **errmsg_fmt, char **errmsg_arg, int flags) | Extension |
Executes a program. program and argv are the arguments to
this_pname is name of the calling program (i.e., temp_base is the path name, sans suffix, of a temporary file to
use if needed. This is currently only needed for MS-DOS ports that
don't use ( The result is the pid on systems like Unix where we
The result is the Upon failure, errmsg_fmt and errmsg_arg are set to the
text of the error message with an optional argument (if not needed,
errmsg_arg is set to |
void psignal (unsigned signo, char *message) | Supplemental |
Print message to the standard error, followed by a colon, followed by the description of the signal specified by signo, followed by a newline. |
int putenv (const char *string) | Supplemental |
Uses |
int pwait (int pid, int *status, int flags) | Extension |
Waits for a program started by pid is the process id of the task to wait for. status is the `status' argument to wait. flags is currently unused (allows future enhancement without breaking upward compatibility). Pass 0 for now. The result is the pid of the child reaped, or -1 for failure
( On systems that don't support waiting for a particular child, pid is
ignored. On systems like MS-DOS that don't really multitask |
long int random (void) | Supplement |
void srandom (unsigned int seed) | Supplement |
void* initstate (unsigned int seed, void *arg_state, unsigned long n) | Supplement |
void* setstate (void *arg_state) | Supplement |
Random number functions. |
char* reconcat (char *optr, const char *s1, ..., NULL )
|
Extension |
Same as str = reconcat (str, "pre-", str, NULL); |
int rename (const char *old, const char *new) | Supplemental |
Renames a file from old to new. If new already exists, it is removed. |
char* rindex (const char *s, int c) | Supplemental |
Returns a pointer to the last occurrence of the character c in
the string s, or |
int setenv (const char *name, const char *value, int overwrite) | Supplemental |
void unsetenv (const char *name) | Supplemental |
|
int signo_max (void) | Extension |
Returns the maximum signal value for which a corresponding symbolic
name or message is available. Note that in the case where we use the
We return the maximum value that can be used to obtain a meaningful symbolic name or message. |
int sigsetmask (int set) | Supplemental |
Sets the signal mask to the one provided in set and returns
the old mask (which, for libiberty's implementation, will always
be the value |
char* spaces (int count) | Extension |
Returns a pointer to a memory region filled with the specified number of spaces and null terminated. The returned pointer is valid until at least the next call. |
int strcasecmp (const char *s1, const char *s2) | Supplemental |
A case-insensitive |
char* strchr (const char *s, int c) | Supplemental |
Returns a pointer to the first occurrence of the character c in
the string s, or |
char* strdup (const char *s) | Supplemental |
Returns a pointer to a copy of s in memory obtained from
|
const char* strerrno (int errnum) | Replacement |
Given an error number returned from a system call (typically returned
in If the supplied error number is within the valid range of indices for
symbolic names, but no name is available for the particular error
number, then returns the string If the supplied error number is not within the range of valid
indices, then returns The contents of the location pointed to are only guaranteed to be
valid until the next call to |
char* strerror (int errnoval) | Supplemental |
Maps an If the supplied error number is within the valid range of indices for
the If the supplied error number is not a valid index into
The returned string is only guaranteed to be valid only until the
next call to |
int strncasecmp (const char *s1, const char *s2) | Supplemental |
A case-insensitive |
int strncmp (const char *s1, const char *s2, size_t n) | Supplemental |
Compares the first n bytes of two strings, returning a value as
|
char* strrchr (const char *s, int c) | Supplemental |
Returns a pointer to the last occurrence of the character c in
the string s, or |
const char * strsignal (int signo) | Supplemental |
Maps an signal number to an signal message string, the contents of
which are implementation defined. On systems which have the external
variable If the supplied signal number is within the valid range of indices for
the If the supplied signal number is not a valid index into
The returned string is only guaranteed to be valid only until the next
call to |
const char* strsigno (int signo) | Extension |
Given an signal number, returns a pointer to a string containing the
symbolic name of that signal number, as found in If the supplied signal number is within the valid range of indices for
symbolic names, but no name is available for the particular signal
number, then returns the string If the supplied signal number is not within the range of valid
indices, then returns The contents of the location pointed to are only guaranteed to be
valid until the next call to |
char* strstr (const char *string, const char *sub) | Supplemental |
This function searches for the substring sub in the string
string, not including the terminating null characters. A pointer
to the first occurrence of sub is returned, or |
double strtod (const char *string, char **endptr) | Supplemental |
This ISO C function converts the initial portion of string to a
|
int strtoerrno (const char *name) | Extension |
Given the symbolic name of a error number (e.g., |
long int strtol (const char *string, char **endptr, int base) | Supplemental |
unsigned long int strtoul (const char *string, char **endptr, int base) | Supplemental |
The |
int strtosigno (const char *name) | Extension |
Given the symbolic name of a signal, map it to a signal number. If no translation is found, returns 0. |
char* tmpnam (char *s) | Supplemental |
This function attempts to create a name for a temporary file, which
will be a valid file name yet not exist when |
int vasprintf (char **resptr, const char *format, va_list args) | Extension |
Like |
int vfork (void) | Supplemental |
Emulates |
int vprintf (const char *format, va_list ap) | Supplemental |
int vfprintf (FILE *stream, const char *format, va_list ap) | Supplemental |
int vsprintf (char *str, const char *format, va_list ap) | Supplemental |
These functions are the same as |
int waitpid (int pid, int *status, int) | Supplemental |
This is a wrapper around the |
int xatexit (void (*fn) (void)) | Function |
Behaves as the standard |
void* xcalloc (size_t nelem, size_t elsize) | Replacement |
Allocate memory without fail, and set it to zero. This routine functions
like |
void xexit (int code) | Replacement |
Terminates the program. If any functions have been registered with
the |
void* xmalloc (size_t) | Replacement |
Allocate memory without fail. If |
void xmalloc_failed (size_t) | Replacement |
This function is not meant to be called by client code, and is listed here for completeness only. If any of the allocation routines fail, this function will be called to print an error message and terminate execution. |
void xmalloc_set_program_name (const char *name) | Replacement |
You can use this to set the name of the program used by
|
void* xmemdup (void *input, size_t copy_size, size_t alloc_size) | Replacement |
Duplicates a region of memory without fail. First, alloc_size bytes are allocated, then copy_size bytes from input are copied into it, and the new memory is returned. If fewer bytes are copied than were allocated, the remaining memory is zeroed. |
void* xrealloc (void *ptr, size_t size) | Replacement |
Reallocate memory without fail. This routine functions like realloc ,
but will behave the same as xmalloc if memory cannot be found.
|
char* xstrdup (const char *s) | Replacement |
Duplicates a character string without fail, using |
char* xstrerror (int errnum) | Replacement |
Behaves exactly like the standard |
Copyright © 1991, 1999 Free Software Foundation, Inc. 59 Temple Place -- Suite 330, Boston, MA 02111-1307, USA Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. [This is the first released version of the Lesser GPL. It also counts as the successor of the GNU Library Public License, version 2, hence the version number 2.1.]
The licenses for most software are designed to take away your freedom to share and change it. By contrast, the GNU General Public Licenses are intended to guarantee your freedom to share and change free software--to make sure the software is free for all its users.
This license, the Lesser General Public License, applies to some specially designated software--typically libraries--of the Free Software Foundation and other authors who decide to use it. You can use it too, but we suggest you first think carefully about whether this license or the ordinary General Public License is the better strategy to use in any particular case, based on the explanations below.
When we speak of free software, we are referring to freedom of use, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for this service if you wish); that you receive source code or can get it if you want it; that you can change the software and use pieces of it in new free programs; and that you are informed that you can do these things.
To protect your rights, we need to make restrictions that forbid distributors to deny you these rights or to ask you to surrender these rights. These restrictions translate to certain responsibilities for you if you distribute copies of the library or if you modify it.
For example, if you distribute copies of the library, whether gratis or for a fee, you must give the recipients all the rights that we gave you. You must make sure that they, too, receive or can get the source code. If you link other code with the library, you must provide complete object files to the recipients, so that they can relink them with the library after making changes to the library and recompiling it. And you must show them these terms so they know their rights.
We protect your rights with a two-step method: (1) we copyright the library, and (2) we offer you this license, which gives you legal permission to copy, distribute and/or modify the library.
To protect each distributor, we want to make it very clear that there is no warranty for the free library. Also, if the library is modified by someone else and passed on, the recipients should know that what they have is not the original version, so that the original author's reputation will not be affected by problems that might be introduced by others.
Finally, software patents pose a constant threat to the existence of any free program. We wish to make sure that a company cannot effectively restrict the users of a free program by obtaining a restrictive license from a patent holder. Therefore, we insist that any patent license obtained for a version of the library must be consistent with the full freedom of use specified in this license.
Most GNU software, including some libraries, is covered by the ordinary GNU General Public License. This license, the GNU Lesser General Public License, applies to certain designated libraries, and is quite different from the ordinary General Public License. We use this license for certain libraries in order to permit linking those libraries into non-free programs.
When a program is linked with a library, whether statically or using a shared library, the combination of the two is legally speaking a combined work, a derivative of the original library. The ordinary General Public License therefore permits such linking only if the entire combination fits its criteria of freedom. The Lesser General Public License permits more lax criteria for linking other code with the library.
We call this license the Lesser General Public License because it does Less to protect the user's freedom than the ordinary General Public License. It also provides other free software developers Less of an advantage over competing non-free programs. These disadvantages are the reason we use the ordinary General Public License for many libraries. However, the Lesser license provides advantages in certain special circumstances.
For example, on rare occasions, there may be a special need to encourage the widest possible use of a certain library, so that it becomes a de-facto standard. To achieve this, non-free programs must be allowed to use the library. A more frequent case is that a free library does the same job as widely used non-free libraries. In this case, there is little to gain by limiting the free library to free software only, so we use the Lesser General Public License.
In other cases, permission to use a particular library in non-free programs enables a greater number of people to use a large body of free software. For example, permission to use the GNU C Library in non-free programs enables many more people to use the whole GNU operating system, as well as its variant, the GNU/Linux operating system.
Although the Lesser General Public License is Less protective of the users' freedom, it does ensure that the user of a program that is linked with the Library has the freedom and the wherewithal to run that program using a modified version of the Library.
The precise terms and conditions for copying, distribution and modification follow. Pay close attention to the difference between a "work based on the library" and a "work that uses the library". The former contains code derived from the library, whereas the latter must be combined with the library in order to run.
A "library" means a collection of software functions and/or data prepared so as to be conveniently linked with application programs (which use some of those functions and data) to form executables.
The "Library", below, refers to any such software library or work which has been distributed under these terms. A "work based on the Library" means either the Library or any derivative work under copyright law: that is to say, a work containing the Library or a portion of it, either verbatim or with modifications and/or translated straightforwardly into another language. (Hereinafter, translation is included without limitation in the term "modification".)
"Source code" for a work means the preferred form of the work for making modifications to it. For a library, complete source code means all the source code for all modules it contains, plus any associated interface definition files, plus the scripts used to control compilation and installation of the library.
Activities other than copying, distribution and modification are not covered by this License; they are outside its scope. The act of running a program using the Library is not restricted, and output from such a program is covered only if its contents constitute a work based on the Library (independent of the use of the Library in a tool for writing it). Whether that is true depends on what the Library does and what the program that uses the Library does.
You may charge a fee for the physical act of transferring a copy, and you may at your option offer warranty protection in exchange for a fee.
(For example, a function in a library to compute square roots has a purpose that is entirely well-defined independent of the application. Therefore, Subsection 2d requires that any application-supplied function or table used by this function must be optional: if the application does not supply it, the square root function must still compute square roots.)
These requirements apply to the modified work as a whole. If identifiable sections of that work are not derived from the Library, and can be reasonably considered independent and separate works in themselves, then this License, and its terms, do not apply to those sections when you distribute them as separate works. But when you distribute the same sections as part of a whole which is a work based on the Library, the distribution of the whole must be on the terms of this License, whose permissions for other licensees extend to the entire whole, and thus to each and every part regardless of who wrote it.
Thus, it is not the intent of this section to claim rights or contest your rights to work written entirely by you; rather, the intent is to exercise the right to control the distribution of derivative or collective works based on the Library.
In addition, mere aggregation of another work not based on the Library with the Library (or with a work based on the Library) on a volume of a storage or distribution medium does not bring the other work under the scope of this License.
Once this change is made in a given copy, it is irreversible for that copy, so the ordinary GNU General Public License applies to all subsequent copies and derivative works made from that copy.
This option is useful when you wish to copy part of the code of the Library into a program that is not a library.
If distribution of object code is made by offering access to copy from a designated place, then offering equivalent access to copy the source code from the same place satisfies the requirement to distribute the source code, even though third parties are not compelled to copy the source along with the object code.
However, linking a "work that uses the Library" with the Library creates an executable that is a derivative of the Library (because it contains portions of the Library), rather than a "work that uses the library". The executable is therefore covered by this License. Section 6 states terms for distribution of such executables.
When a "work that uses the Library" uses material from a header file that is part of the Library, the object code for the work may be a derivative work of the Library even though the source code is not. Whether this is true is especially significant if the work can be linked without the Library, or if the work is itself a library. The threshold for this to be true is not precisely defined by law.
If such an object file uses only numerical parameters, data structure layouts and accessors, and small macros and small inline functions (ten lines or less in length), then the use of the object file is unrestricted, regardless of whether it is legally a derivative work. (Executables containing this object code plus portions of the Library will still fall under Section 6.)
Otherwise, if the work is a derivative of the Library, you may distribute the object code for the work under the terms of Section 6. Any executables containing that work also fall under Section 6, whether or not they are linked directly with the Library itself.
You must give prominent notice with each copy of the work that the Library is used in it and that the Library and its use are covered by this License. You must supply a copy of this License. If the work during execution displays copyright notices, you must include the copyright notice for the Library among them, as well as a reference directing the user to the copy of this License. Also, you must do one of these things:
For an executable, the required form of the "work that uses the Library" must include any data and utility programs needed for reproducing the executable from it. However, as a special exception, the materials to be distributed need not include anything that is normally distributed (in either source or binary form) with the major components (compiler, kernel, and so on) of the operating system on which the executable runs, unless that component itself accompanies the executable.
It may happen that this requirement contradicts the license restrictions of other proprietary libraries that do not normally accompany the operating system. Such a contradiction means you cannot use both them and the Library together in an executable that you distribute.
If any portion of this section is held invalid or unenforceable under any particular circumstance, the balance of the section is intended to apply, and the section as a whole is intended to apply in other circumstances.
It is not the purpose of this section to induce you to infringe any patents or other property right claims or to contest validity of any such claims; this section has the sole purpose of protecting the integrity of the free software distribution system which is implemented by public license practices. Many people have made generous contributions to the wide range of software distributed through that system in reliance on consistent application of that system; it is up to the author/donor to decide if he or she is willing to distribute software through any other system and a licensee cannot impose that choice.
This section is intended to make thoroughly clear what is believed to be a consequence of the rest of this License.
Each version is given a distinguishing version number. If the Library specifies a version number of this License which applies to it and "any later version", you have the option of following the terms and conditions either of that version or of any later version published by the Free Software Foundation. If the Library does not specify a license version number, you may choose any version ever published by the Free Software Foundation.
If you develop a new library, and you want it to be of the greatest possible use to the public, we recommend making it free software that everyone can redistribute and change. You can do so by permitting redistribution under these terms (or, alternatively, under the terms of the ordinary General Public License).
To apply these terms, attach the following notices to the library. It is safest to attach them to the start of each source file to most effectively convey the exclusion of warranty; and each file should have at least the "copyright" line and a pointer to where the full notice is found.
one line to give the library's name and an idea of what it does. Copyright (C) year name of author This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. This library is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307, USA.
Also add information on how to contact you by electronic and paper mail.
You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the library, if necessary. Here is a sample; alter the names:
Yoyodyne, Inc., hereby disclaims all copyright interest in the library `Frob' (a library for tweaking knobs) written by James Random Hacker. signature of Ty Coon, 1 April 1990 Ty Coon, President of Vice
That's all there is to it!
Copyright © 1990 Regents of the University of California. All rights reserved.
Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
alloca
: Functions
asprintf
: Functions
atexit
: Functions
basename
: Functions
bcmp
: Functions
bcopy
: Functions
bsearch
: Functions
buildargv
: Functions
bzero
: Functions
calloc
: Functions
choose_temp_base
: Functions
choose_tmpdir
: Functions
clock
: Functions
concat
: Functions
dupargv
: Functions
errno_max
: Functions
fdmatch
: Functions
ffs
: Functions
fnmatch
: Functions
freeargv
: Functions
get_run_time
: Functions
getcwd
: Functions
getpagesize
: Functions
getpwd
: Functions
hex_init
: Functions
hex_p
: Functions
hex_value
: Functions
index
: Functions
initstate
: Functions
insque
: Functions
lbasename
: Functions
lrealpath
: Functions
make_relative_prefix
: Functions
make_temp_file
: Functions
memchr
: Functions
memcmp
: Functions
memcpy
: Functions
memmove
: Functions
memset
: Functions
mkstemps
: Functions
obstack.h
: Creating Obstacks
obstack_1grow
: Growing Objects
obstack_1grow_fast
: Extra Fast Growing
obstack_alignment_mask
: Obstacks Data Alignment
obstack_alloc
: Allocation in an Obstack
obstack_alloc_failed_handler
: Preparing for Obstacks
obstack_base
: Status of an Obstack
obstack_blank
: Growing Objects
obstack_blank_fast
: Extra Fast Growing
obstack_chunk_alloc
: Preparing for Obstacks
obstack_chunk_free
: Preparing for Obstacks
obstack_chunk_size
: Obstack Chunks
obstack_copy
: Allocation in an Obstack
obstack_copy0
: Allocation in an Obstack
obstack_finish
: Growing Objects
obstack_free
: Freeing Obstack Objects
obstack_grow
: Growing Objects
obstack_grow0
: Growing Objects
obstack_init
: Preparing for Obstacks
obstack_int_grow
: Growing Objects
obstack_int_grow_fast
: Extra Fast Growing
obstack_next_free
: Status of an Obstack
obstack_object_size
: Status of an Obstack, Growing Objects
obstack_ptr_grow
: Growing Objects
obstack_ptr_grow_fast
: Extra Fast Growing
obstack_room
: Extra Fast Growing
pexecute
: Functions
psignal
: Functions
putenv
: Functions
pwait
: Functions
random
: Functions
reconcat
: Functions
remque
: Functions
rename
: Functions
rindex
: Functions
setenv
: Functions
setstate
: Functions
signo_max
: Functions
sigsetmask
: Functions
spaces
: Functions
srandom
: Functions
strcasecmp
: Functions
strchr
: Functions
strdup
: Functions
strerrno
: Functions
strerror
: Functions
strncasecmp
: Functions
strncmp
: Functions
strrchr
: Functions
strsignal
: Functions
strsigno
: Functions
strstr
: Functions
strtod
: Functions
strtoerrno
: Functions
strtol
: Functions
strtosigno
: Functions
strtoul
: Functions
tmpnam
: Functions
unsetenv
: Functions
vasprintf
: Functions
vfork
: Functions
vfprintf
: Functions
vprintf
: Functions
vsprintf
: Functions
waitpid
: Functions
xatexit
: Functions
xcalloc
: Functions
xexit
: Functions
xmalloc
: Functions
xmalloc_failed
: Functions
xmalloc_set_program_name
: Functions
xmemdup
: Functions
xrealloc
: Functions
xstrdup
: Functions
xstrerror
: Functions