| /src/external/gpl3/binutils/dist/binutils/ |
| arsup.h | 21 struct list { struct
23 struct list *next;
32 void ar_replace (struct list *);
34 void ar_delete (struct list *);
42 void ar_directory (char *, struct list *, char *);
44 void ar_addmod (struct list *);
46 void ar_addlib (char *, struct list *);
50 void ar_extract (struct list *);
|
| /src/external/gpl3/binutils.old/dist/binutils/ |
| arsup.h | 21 struct list { struct
23 struct list *next;
32 void ar_replace (struct list *);
34 void ar_delete (struct list *);
42 void ar_directory (char *, struct list *, char *);
44 void ar_addmod (struct list *);
46 void ar_addlib (char *, struct list *);
50 void ar_extract (struct list *);
|
| /src/tests/usr.bin/xlint/lint1/ |
| d_cast_typeof.c | 7 char list; member in struct:foo
15 ((char *)&((typeof(hole))0)->list) :
16 ((char *)&((typeof(*hole) *)0)->list);
|
| /src/crypto/external/cpl/trousers/dist/src/tspi/daa/utils/ |
| list.c | 13 #include <list.h>
18 list_ptr list = (list_ptr)malloc( sizeof( list_struct)); local
20 if( list == NULL) return NULL;
21 list->head = NULL;
22 return list;
25 void list_add(list_ptr list, void *obj) {
26 list->current = (node_t *) malloc (sizeof(struct _list_t));
27 if (list->current == NULL) {
31 if( list->head == NULL) {
32 list->head = list->current
[all...] |
| /src/external/gpl2/gettext/dist/gettext-tools/gnulib-lib/ |
| gl_list.c | 1 /* Abstract sequential list data type.
52 gl_list_size (gl_list_t list)
54 return ((const struct gl_list_impl_base *) list)->vtable
55 ->size (list);
59 gl_list_node_value (gl_list_t list, gl_list_node_t node)
61 return ((const struct gl_list_impl_base *) list)->vtable
62 ->node_value (list, node);
66 gl_list_next_node (gl_list_t list, gl_list_node_t node)
68 return ((const struct gl_list_impl_base *) list)->vtable
69 ->next_node (list, node)
[all...] |
| gl_list.h | 1 /* Abstract sequential list data type.
30 /* gl_list is an abstract list data type. It can contain any number of
34 There are several implementations of this list datatype, optimized for
35 different operations or for memory. You can start using the simplest list
45 GL_LINKED_LIST a linked list
48 GL_LINKEDHASH_LIST a hash table with a linked list
53 in the list. When looking more closely at the average memory consumed
57 The guaranteed average performance of the operations is, for a list of
106 /* Type representing an entire list. */
110 /* Type representing the position of an element in the list, in a way tha
259 gl_list_t list; member in struct:__anon9185
[all...] |
| /src/external/gpl3/gcc/dist/libobjc/objc-private/ |
| objc-list.h | 1 /* Generic single linked list to keep various information
50 list_remove_head (struct objc_list** list)
52 if ((*list)->tail)
55 struct objc_list* tail = (*list)->tail;
57 /* Copy next to list head. */
58 *(*list) = *tail;
65 /* Inly one element in list. */
66 objc_free (*list);
67 (*list) = 0;
72 /* Map FUNCTION over all elements in LIST. *
[all...] |
| /src/external/gpl3/gcc.old/dist/libobjc/objc-private/ |
| objc-list.h | 1 /* Generic single linked list to keep various information
50 list_remove_head (struct objc_list** list)
52 if ((*list)->tail)
55 struct objc_list* tail = (*list)->tail;
57 /* Copy next to list head. */
58 *(*list) = *tail;
65 /* Inly one element in list. */
66 objc_free (*list);
67 (*list) = 0;
72 /* Map FUNCTION over all elements in LIST. *
[all...] |
| /src/external/ibm-public/postfix/dist/src/util/ |
| inet_addr_list.c | 7 /* internet address list manager
11 /* void inet_addr_list_init(list)
12 /* INET_ADDR_LIST *list;
14 /* void inet_addr_list_append(list,addr)
15 /* INET_ADDR_LIST *list;
18 /* void inet_addr_list_uniq(list)
19 /* INET_ADDR_LIST *list;
21 /* void inet_addr_list_free(list)
22 /* INET_ADDR_LIST *list;
31 /* the specified list, extending the list on the fly
171 INET_ADDR_LIST list; local
[all...] |
| /src/external/ibm-public/postfix/dist/src/global/ |
| recipient_list.c | 35 /* void recipient_list_init(list, variant)
36 /* RECIPIENT_LIST *list;
39 /* void recipient_list_add(list, offset, dsn_orcpt, dsn_notify,
41 /* RECIPIENT_LIST *list;
52 /* void recipient_list_free(list)
53 /* RECIPIENT_LIST *list;
71 /* recipient_list_init() creates an empty recipient structure list.
72 /* The list argument is initialized such that it can be given to
74 /* argument specifies how list elements should be initialized;
78 /* recipient_list_add() adds a recipient to the specified list
[all...] |
| /src/external/bsd/unbound/dist/services/ |
| outbound_list.c | 2 * services/outbound_list.c - keep list of outbound serviced queries.
13 * this list of conditions and the following disclaimer.
16 * this list of conditions and the following disclaimer in the documentation
48 outbound_list_init(struct outbound_list* list)
50 list->first = NULL;
54 outbound_list_clear(struct outbound_list* list)
57 p = list->first;
64 outbound_list_init(list);
68 outbound_list_insert(struct outbound_list* list, struct outbound_entry* e)
70 if(list->first
[all...] |
| /src/external/bsd/wpa/dist/src/utils/ |
| list.h | 2 * Doubly-linked list
13 * struct dl_list - Doubly-linked list
22 static inline void dl_list_init(struct dl_list *list)
24 list->next = list;
25 list->prev = list;
28 static inline void dl_list_add(struct dl_list *list, struct dl_list *item)
30 item->next = list->next;
31 item->prev = list;
[all...] |
| /src/external/gpl3/gcc/dist/libgomp/ |
| error.c | 41 gomp_vdebug (int kind __attribute__ ((unused)), const char *msg, va_list list)
44 vfprintf (stderr, msg, list);
51 va_list list; local
53 va_start (list, msg);
54 gomp_vdebug (kind, msg, list);
55 va_end (list);
59 gomp_verror (const char *fmt, va_list list)
62 vfprintf (stderr, fmt, list);
69 va_list list; local
71 va_start (list, fmt)
86 va_list list; local
[all...] |
| /src/external/gpl3/gcc.old/dist/libgomp/ |
| error.c | 41 gomp_vdebug (int kind __attribute__ ((unused)), const char *msg, va_list list)
44 vfprintf (stderr, msg, list);
51 va_list list; local
53 va_start (list, msg);
54 gomp_vdebug (kind, msg, list);
55 va_end (list);
59 gomp_verror (const char *fmt, va_list list)
62 vfprintf (stderr, fmt, list);
69 va_list list; local
71 va_start (list, fmt)
86 va_list list; local
[all...] |
| /src/external/mit/isl/dist/ |
| set_list_from_map_list_inl.c | 3 /* Return the set list that was treated as the map list "list".
6 __isl_take isl_map_list *list)
8 return (isl_set_list *) list;
|
| isl_list_read_templ.c | 13 /* Read a list of elements of type EL from "s".
17 * the entire list is surrounded by parentheses.
19 __isl_give LIST(EL) *FN(isl_stream_read,LIST(EL_BASE))(isl_stream *s)
22 LIST(EL) *list;
27 list = FN(LIST(EL),alloc)(ctx, 0);
28 if (!list)
31 return FN(LIST(EL),free)(list)
[all...] |
| /src/external/gpl2/groff/dist/src/preproc/eqn/ |
| list.cpp | 1 /* $NetBSD: list.cpp,v 1.1.1.1 2016/01/13 18:41:49 christos Exp $ */
40 list.append(pp);
42 for (int i = 0; i < q->list.len; i++) {
43 list.append(q->list.p[i]);
44 q->list.p[i] = 0;
46 q->list.len = 0;
51 list_box::list_box(box *pp) : list(pp), sty(-1)
56 list.p[0] = q->list.p[0]
[all...] |
| /src/sys/external/bsd/drm2/dist/include/drm/ttm/ |
| ttm_execbuf_util.h | 36 #include <linux/list.h>
43 * @head: list head for thread-private list.
58 * @list: thread private list of ttm_validate_buffer structs.
61 * the list entries.
65 struct list_head *list);
72 * @list: thread private list of ttm_validate_buffer structs.
74 * @dups: [out] optional list of duplicates
[all...] |
| /src/sys/external/bsd/drm2/include/linux/ |
| rculist.h | 11 * notice, this list of conditions and the following disclaimer.
13 * notice, this list of conditions and the following disclaimer in the
32 #include <linux/list.h>
|
| /src/external/bsd/jemalloc/dist/include/jemalloc/internal/ |
| typed_list.h | 5 * This wraps the ql module to implement a list class in a way that's a little
14 list_type##_init(list_type##_t *list) { \
15 ql_new(&list->head); \
18 list_type##_first(const list_type##_t *list) { \
19 return ql_first(&list->head); \
22 list_type##_last(const list_type##_t *list) { \
23 return ql_last(&list->head, linkage); \
26 list_type##_append(list_type##_t *list, el_type *item) { \
28 ql_tail_insert(&list->head, item, linkage); \
31 list_type##_prepend(list_type##_t *list, el_type *item) {
[all...] |
| /src/external/bsd/jemalloc/include/jemalloc/internal/ |
| typed_list.h | 5 * This wraps the ql module to implement a list class in a way that's a little
14 list_type##_init(list_type##_t *list) { \
15 ql_new(&list->head); \
18 list_type##_first(const list_type##_t *list) { \
19 return ql_first(&list->head); \
22 list_type##_last(const list_type##_t *list) { \
23 return ql_last(&list->head, linkage); \
26 list_type##_append(list_type##_t *list, el_type *item) { \
28 ql_tail_insert(&list->head, item, linkage); \
31 list_type##_prepend(list_type##_t *list, el_type *item) {
[all...] |
| /src/external/bsd/openldap/dist/contrib/ldapc++/src/ |
| SaslInteractionHandler.h | 11 #include <list>
17 virtual void handleInteractions( const std::list<SaslInteraction*> &cb )=0;
23 virtual void handleInteractions( const std::list<SaslInteraction*> &cb );
27 std::list<SaslInteraction*> cleanupList;
|
| /src/external/bsd/ntp/dist/libntp/lib/isc/include/isc/ |
| list.h | 1 /* $NetBSD: list.h,v 1.2 2024/08/18 20:47:14 christos Exp $ */
34 #define ISC_LIST_INIT(list) \
35 do { (list).head = NULL; (list).tail = NULL; } while (0)
47 #define ISC_LIST_HEAD(list) ((list).head)
48 #define ISC_LIST_TAIL(list) ((list).tail)
49 #define ISC_LIST_EMPTY(list) ISC_TF((list).head == NULL
[all...] |
| /src/external/cddl/osnet/dist/uts/common/os/ |
| list.c | 29 * Generic doubly-linked list implementation
32 #include <sys/list.h>
46 #define list_insert_after_node(list, node, object) { \
47 list_node_t *lnew = list_d2l(list, object); \
54 #define list_insert_before_node(list, node, object) { \
55 list_node_t *lnew = list_d2l(list, object); \
68 list_create(list_t *list, size_t size, size_t offset)
70 ASSERT(list);
74 list->list_size = size;
75 list->list_offset = offset
[all...] |
| /src/external/gpl2/gettext/dist/gettext-tools/src/ |
| format-lisp.c | 40 #define VERIFY_LIST(list) verify_list (list)
47 argument list. It is a recursive list structure. Structure sharing
52 FCT_REQUIRED, /* The format argument list cannot end before this argument. */
53 FCT_OPTIONAL /* The format argument list may end before this argument. */
75 enum format_cdr_type presence; /* Can the argument list end right before
78 struct format_arg_list *list; /* For FAT_LIST: List elements. */ member in struct:format_arg
83 /* The constraints for the potentially infinite argument list are assume
108 struct format_arg_list *list; member in struct:spec
598 struct format_arg_list *list; local
625 struct format_arg_list *list; local
2099 struct format_arg_list *list; local
2462 struct format_arg_list *list = *listp; local
[all...] |
