Lines Matching defs:Alist
26 * Define an Alist, a list maintained as a reallocable array, and a for() loop
43 * An Alist implements array lists. The functionality is similar to
44 * that of a linked list. However, an Alist is represented by a single
53 * Alist - Contain arbitrary data, usually structs.
77 * length, so the Alist module cannot prevent the caller from
94 * Alist is used to hold non-pointer items --- usually structs:
106 * requirement to have an even # of Alist fields (above).
109 * index, or by their byte offset from the start of the Alist memory
120 } Alist;
123 * APlist is a variant of Alist that contains pointers. There are several
153 #define ALIST_OFF_DATA ((size_t)(((Alist *)0)->al_data))
161 * ALIST_TRAVERSE: Traverse over the items in an Alist,
165 * Alist using the byte offset from the head of the
166 * Alist pointer to refer to each item. It should be noted
183 * LIST - Pointer to Alist structure for list
240 * Access to an Alist item by index or offset. This is needed because the
241 * size of an item in an Alist is not known by the C compiler, and we
262 extern void *alist_append(Alist **, const void *, size_t, Aliste);
263 extern void alist_delete(Alist *, Aliste *);
264 extern void alist_delete_by_offset(Alist *, Aliste *);
265 extern void *alist_insert(Alist **, const void *, size_t,
267 extern void *alist_insert_by_offset(Alist **, const void *, size_t,
269 extern void alist_reset(Alist *);