/freebsd-11-stable/contrib/binutils/binutils/ |
H A D | 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 *);
|
/freebsd-11-stable/contrib/libstdc++/include/backward/ |
H A D | list.h | 62 #include <list> 64 using std::list;
|
/freebsd-11-stable/contrib/bmake/lst.lib/ |
H A D | lstNext.c | 14 * notice, this list of conditions and the following disclaimer. 16 * notice, this list of conditions and the following disclaimer in the 50 * Return the next node for a list. 51 * The sequential functions access the list in a slightly different way. 52 * CurPtr points to their idea of the current node in the list and they 53 * access the list based on it. Because the list is circular, Lst_Next 54 * and Lst_Prev will go around the list forever. Lst_IsAtEnd must be 63 * Return the next node for the given list. 66 * The next node or NULL if the list ha 79 List list = l; local [all...] |
H A D | lstIsAtEnd.c | 14 * notice, this list of conditions and the following disclaimer. 16 * notice, this list of conditions and the following disclaimer in the 50 * Tell if the current node is at the end of the list. 51 * The sequential functions access the list in a slightly different way. 52 * CurPtr points to their idea of the current node in the list and they 53 * access the list based on it. Because the list is circular, Lst_Next 54 * and Lst_Prev will go around the list forever. Lst_IsAtEnd must be 63 * Return true if have reached the end of the given list. 66 * TRUE if at the end of the list (thi 82 List list = l; local [all...] |
H A D | lstRemove.c | 14 * notice, this list of conditions and the following disclaimer. 16 * notice, this list of conditions and the following disclaimer in the 50 * Remove an element from a list 58 * Remove the given node from the given list. 64 * The list's firstPtr will be set to NULL if ln is the last 65 * node on the list. firsPtr and lastPtr will be altered if ln is 66 * either the first or last node, respectively, on the list. 73 List list = l; local 82 * unlink it from the list 92 * if either the firstPtr or lastPtr of the list poin [all...] |
H A D | lstDestroy.c | 14 * notice, this list of conditions and the following disclaimer. 16 * notice, this list of conditions and the following disclaimer in the 50 * Nuke a list and all its resources 58 * Destroy a list and free all its resources. If the freeProc is 66 * The given list is freed in its entirety. 71 Lst_Destroy(Lst list, FreeProc *freeProc) argument 76 if (list == NULL) 80 if (list->lastPtr != NULL) 81 list->lastPtr->nextPtr = NULL; 83 free(list); [all...] |
H A D | lstMember.c | 14 * notice, this list of conditions and the following disclaimer. 16 * notice, this list of conditions and the following disclaimer in the 50 * See if a given datum is on a given list. 58 List list = l; local 61 if (list == NULL) { 64 lNode = list->firstPtr; 74 } while (lNode != NULL && lNode != list->firstPtr);
|
H A D | lstClose.c | 14 * notice, this list of conditions and the following disclaimer. 16 * notice, this list of conditions and the following disclaimer in the 50 * Close a list for sequential access. 51 * The sequential functions access the list in a slightly different way. 52 * CurPtr points to their idea of the current node in the list and they 53 * access the list based on it. Because the list is circular, Lst_Next 54 * and Lst_Prev will go around the list forever. Lst_IsAtEnd must be 63 * Close a list which was opened for sequential access. 66 * l The list t 79 List list = l; local [all...] |
/freebsd-11-stable/contrib/gcclibs/libgomp/ |
H A D | error.c | 42 gomp_verror (const char *fmt, va_list list) argument 45 vfprintf (stderr, fmt, list); 52 va_list list; local 54 va_start (list, fmt); 55 gomp_verror (fmt, list); 56 va_end (list); 62 va_list list; local 64 va_start (list, fmt); 65 gomp_verror (fmt, list); 66 va_end (list); [all...] |
/freebsd-11-stable/usr.sbin/ppp/ |
H A D | iplist.c | 11 * notice, this list of conditions and the following disclaimer. 13 * notice, this list of conditions and the following disclaimer in the 58 iplist_first(struct iplist *list) argument 60 list->cur.pos = -1; 64 iplist_setrange(struct iplist *list, char *range) argument 69 if (!inet_aton(range, &list->cur.ip)) 71 list->cur.lstart = ntohl(list->cur.ip.s_addr); 72 list->cur.nItems = 1; 74 if (!do_inet_aton(range, ptr, &list 101 iplist_nextrange(struct iplist *list) argument 130 iplist_next(struct iplist *list) argument 152 iplist_setsrc(struct iplist *list, const char *src) argument 167 iplist_reset(struct iplist *list) argument 175 iplist_setcurpos(struct iplist *list, long pos) argument 203 iplist_setrandpos(struct iplist *list) argument 210 iplist_ip2pos(struct iplist *list, struct in_addr ip) argument [all...] |
/freebsd-11-stable/sys/dev/ocs_fc/ |
H A D | ocs_list.h | 9 * this list of conditions and the following disclaimer. 12 * this list of conditions and the following disclaimer in the documentation 37 * OCS linked list API 52 #define ocs_list_set_list_magic list->magic = OCS_LIST_LIST_MAGIC 53 #define ocs_list_set_link_magic list->magic = OCS_LIST_LINK_MAGIC 67 * @brief list/link structure 69 * used for both the list object, and the link object(s). offset 70 * is specified when the list is initialized; this implies that a list 79 ocs_list_t *next; /*<< pointer to head of list (o 103 _ocs_list_init(ocs_list_t *list, uint32_t offset) argument 124 ocs_list_empty(ocs_list_t *list) argument 140 ocs_list_valid(ocs_list_t *list) argument 195 ocs_list_init_link(ocs_list_t *list, ocs_list_t *link) argument 220 ocs_list_add_head(ocs_list_t *list, void *item) argument 248 ocs_list_add_tail(ocs_list_t *list, void *item) argument 277 ocs_list_get_head(ocs_list_t *list) argument 293 ocs_list_get_tail(ocs_list_t *list) argument 308 ocs_list_tail(ocs_list_t *list) argument 324 ocs_list_next(ocs_list_t *list, void *item) argument 369 ocs_list_remove(ocs_list_t *list, void *item) argument [all...] |
/freebsd-11-stable/contrib/unbound/services/ |
H A D | 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) argument 50 list->first = NULL; 54 outbound_list_clear(struct outbound_list* list) argument 57 p = list->first; 64 outbound_list_init(list); 68 outbound_list_insert(struct outbound_list* list, struct outbound_entry* e) argument 70 if(list 78 outbound_list_remove(struct outbound_list* list, struct outbound_entry* e) argument [all...] |
H A D | outbound_list.h | 2 * services/outbound_list.h - 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 49 * The outbound list. This structure is part of the module specific query 53 /** The linked list of outbound query entries. */ 58 * Outbound list entry. A serviced query sent by a module processing the 59 * query from the qstate. Double linked list to aid removal. 62 /** next in list */ 64 /** prev in list */ 73 * Init the user allocated outbound list structur [all...] |
/freebsd-11-stable/contrib/wpa/src/utils/ |
H A D | list.h | 2 * Doubly-linked list 13 * struct dl_list - Doubly-linked list 22 static inline void dl_list_init(struct dl_list *list) argument 24 list->next = list; 25 list->prev = list; 28 static inline void dl_list_add(struct dl_list *list, struct dl_list *item) argument 30 item->next = list->next; 31 item->prev = list; 36 dl_list_add_tail(struct dl_list *list, struct dl_list *item) argument 49 dl_list_empty(struct dl_list *list) argument 54 dl_list_len(struct dl_list *list) argument [all...] |
/freebsd-11-stable/contrib/groff/src/preproc/eqn/ |
H A D | list.cpp | 38 list.append(pp); 40 for (int i = 0; i < q->list.len; i++) { 41 list.append(q->list.p[i]); 42 q->list.p[i] = 0; 44 q->list.len = 0; 49 list_box::list_box(box *pp) : list(pp), sty(-1) 54 list.p[0] = q->list.p[0]; 55 for (int i = 1; i < q->list [all...] |
/freebsd-11-stable/sys/kern/ |
H A D | subr_eventhandler.c | 9 * notice, this list of conditions and the following disclaimer. 11 * notice, this list of conditions and the following disclaimer in the 55 * Initialize the eventhandler mutex and list. 70 struct eventhandler_list *list, *new_list; local 72 /* look for a matching, existing list */ 73 list = _eventhandler_find_list(name); 75 /* Do we need to create the list? */ 76 if (list == NULL) { 84 list = _eventhandler_find_list(name); 85 if (list ! 106 eventhandler_register_internal(struct eventhandler_list *list, const char *name, eventhandler_tag epn) argument 142 eventhandler_register(struct eventhandler_list *list, const char *name, void *func, void *arg, int priority) argument 166 vimage_eventhandler_register(struct eventhandler_list *list, const char *name, void *func, void *arg, int priority, vimage_iterator_func_t iterfunc) argument 185 _eventhandler_deregister(struct eventhandler_list *list, eventhandler_tag tag, bool wait) argument 226 eventhandler_deregister(struct eventhandler_list *list, eventhandler_tag tag) argument 233 eventhandler_deregister_nowait(struct eventhandler_list *list, eventhandler_tag tag) argument 246 struct eventhandler_list *list; local 262 struct eventhandler_list *list; local 281 eventhandler_prune_list(struct eventhandler_list *list) argument 306 struct eventhandler_list *list; local [all...] |
/freebsd-11-stable/contrib/ntp/lib/isc/include/isc/ |
H A D | list.h | 32 #define ISC_LIST_INIT(list) \ 33 do { (list).head = NULL; (list).tail = NULL; } while (0) 45 #define ISC_LIST_HEAD(list) ((list).head) 46 #define ISC_LIST_TAIL(list) ((list).tail) 47 #define ISC_LIST_EMPTY(list) ISC_TF((list).head == NULL) 49 #define __ISC_LIST_PREPENDUNSAFE(list, el [all...] |
/freebsd-11-stable/sys/cddl/contrib/opensolaris/uts/common/os/ |
H A D | list.c | 29 * Generic doubly-linked list implementation 32 #include <sys/list.h> 42 #define list_insert_after_node(list, node, object) { \ 43 list_node_t *lnew = list_d2l(list, object); \ 50 #define list_insert_before_node(list, node, object) { \ 51 list_node_t *lnew = list_d2l(list, object); \ 64 list_create(list_t *list, size_t size, size_t offset) argument 66 ASSERT(list); 70 list->list_size = size; 71 list 77 list_destroy(list_t *list) argument 89 list_insert_after(list_t *list, void *object, void *nobject) argument 100 list_insert_before(list_t *list, void *object, void *nobject) argument 111 list_insert_head(list_t *list, void *object) argument 118 list_insert_tail(list_t *list, void *object) argument 125 list_remove(list_t *list, void *object) argument 134 list_remove_head(list_t *list) argument 144 list_remove_tail(list_t *list) argument 154 list_head(list_t *list) argument 162 list_tail(list_t *list) argument 170 list_next(list_t *list, void *object) argument 181 list_prev(list_t *list, void *object) argument 242 list_is_empty(list_t *list) argument [all...] |
/freebsd-11-stable/lib/libc/include/isc/ |
H A D | list.h | 30 #define INIT_LIST(list) \ 31 do { (list).head = NULL; (list).tail = NULL; } while (0) 44 #define HEAD(list) ((list).head) 45 #define TAIL(list) ((list).tail) 46 #define EMPTY(list) ((list).head == NULL) 48 #define PREPEND(list, el [all...] |
/freebsd-11-stable/contrib/apr-util/buckets/ |
H A D | apr_buckets_alloc.c | 35 /** A list of free memory from which new buckets or private bucket 47 apr_bucket_alloc_t *list = data; local 49 apr_allocator_free(list->allocator, list->blocks); 52 if (list->pool && list->allocator != apr_pool_allocator_get(list->pool)) { 53 apr_allocator_destroy(list->allocator); 63 apr_bucket_alloc_t *list; local 76 list 93 apr_bucket_alloc_t *list; local 110 apr_bucket_alloc_destroy(apr_bucket_alloc_t *list) argument 156 apr_bucket_alloc(apr_size_t size, apr_bucket_alloc_t *list) argument 207 apr_bucket_alloc_t *list = node->alloc; local 224 apr_bucket_alloc_t *list = node->alloc; local [all...] |
/freebsd-11-stable/cddl/contrib/opensolaris/tools/ctf/common/ |
H A D | list.c | 37 #include "list.h" 40 struct list { struct 42 struct list *l_next; 45 /* Add an element to a list */ 47 list_add(list_t **list, void *data) argument 53 le->l_next = *list; 54 *list = le; 57 /* Add an element to a sorted list */ 59 slist_add(list_t **list, void *data, int (*cmp)(void *, void *)) argument 63 for (nextp = list; *next 79 list_remove(list_t **list, void *data, int (*cmp)(void *, void *, void *), void *private) argument 101 list_free(list_t *list, void (*datafree)(void *, void *), void *private) argument 119 list_iter(list_t *list, int (*func)(void *, void *), void *private) argument 144 list_count(list_t *list) argument 150 list_empty(list_t *list) argument 156 list_find(list_t *list, void *tmpl, int (*cmp)(void *, void *)) argument 167 list_first(list_t *list) argument [all...] |
/freebsd-11-stable/crypto/heimdal/lib/krb5/ |
H A D | set_default_realm.c | 11 * notice, this list of conditions and the following disclaimer. 14 * notice, this list of conditions and the following disclaimer in the 38 * list in `list'. Return an error code. 42 string_to_list (krb5_context context, const char *s, krb5_realm **list) argument 45 *list = malloc (2 * sizeof(**list)); 46 if (*list == NULL) { 51 (*list)[0] = strdup (s); 52 if ((*list)[ [all...] |
/freebsd-11-stable/contrib/less/ |
H A D | lglob.h | 15 * This defines a function that returns a list of matching filenames. 17 * This defines a function that steps thru the list of matching 20 * This defines a function that returns the complete list of 26 #define DECL_GLOB_LIST(list) char **list; char **pp; 27 #define GLOB_LIST(filename,list) list = _fnexplode(filename) 28 #define GLOB_LIST_FAILED(list) list == NULL 29 #define SCAN_GLOB_LIST(list, [all...] |
/freebsd-11-stable/crypto/heimdal/appl/gssmask/ |
H A D | common.c | 11 * notice, this list of conditions and the following disclaimer. 14 * notice, this list of conditions and the following disclaimer in the 53 add_list(char ****list, size_t *listlen, char **str, size_t len) argument 56 *list = erealloc(*list, sizeof(**list) * (*listlen + 1)); 58 (*list)[*listlen] = ecalloc(len, sizeof(**list)); 60 (*list)[*listlen][i] = str[i]; 65 permute(char ****list, size_ argument 85 char **list, ***all = NULL; local [all...] |
/freebsd-11-stable/sys/dev/drm2/ttm/ |
H A D | ttm_execbuf_util.h | 40 * @head: list head for thread-private list. 60 * @list: thread private list of ttm_validate_buffer structs. 63 * the list entries. 66 extern void ttm_eu_backoff_reservation(struct list_head *list); 71 * @list: thread private list of ttm_validate_buffer structs. 73 * Tries to reserve bos pointed to by the list entries for validation. 84 * receives a signal while waiting. In that case, no buffers on the list [all...] |