/freebsd-9.3-release/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-9.3-release/contrib/libstdc++/include/backward/ |
H A D | list.h | 62 #include <list> 64 using std::list;
|
/freebsd-9.3-release/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 | 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-9.3-release/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-9.3-release/usr.sbin/ppp/ |
H A D | iplist.c | 9 * notice, this list of conditions and the following disclaimer. 11 * notice, this list of conditions and the following disclaimer in the 56 iplist_first(struct iplist *list) argument 58 list->cur.pos = -1; 62 iplist_setrange(struct iplist *list, char *range) argument 67 if (!inet_aton(range, &list->cur.ip)) 69 list->cur.lstart = ntohl(list->cur.ip.s_addr); 70 list->cur.nItems = 1; 72 if (!do_inet_aton(range, ptr, &list 99 iplist_nextrange(struct iplist *list) argument 128 iplist_next(struct iplist *list) argument 150 iplist_setsrc(struct iplist *list, const char *src) argument 165 iplist_reset(struct iplist *list) argument 173 iplist_setcurpos(struct iplist *list, long pos) argument 201 iplist_setrandpos(struct iplist *list) argument 208 iplist_ip2pos(struct iplist *list, struct in_addr ip) argument [all...] |
/freebsd-9.3-release/contrib/wpa/src/utils/ |
H A D | list.h | 2 * Doubly-linked list 19 * struct dl_list - Doubly-linked list 26 static inline void dl_list_init(struct dl_list *list) argument 28 list->next = list; 29 list->prev = list; 32 static inline void dl_list_add(struct dl_list *list, struct dl_list *item) argument 34 item->next = list->next; 35 item->prev = list; 40 dl_list_add_tail(struct dl_list *list, struct dl_list *item) argument 53 dl_list_empty(struct dl_list *list) argument 58 dl_list_len(struct dl_list *list) argument [all...] |
/freebsd-9.3-release/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-9.3-release/contrib/bind9/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-9.3-release/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-9.3-release/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-9.3-release/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. 72 eventhandler_register_internal(struct eventhandler_list *list, argument 84 /* Do we need to find/create the (slow) list? */ 85 if (list == NULL) { 86 /* look for a matching, existing list */ 87 list = _eventhandler_find_list(name); 89 /* Do we need to create the list? */ 90 if (list 141 eventhandler_register(struct eventhandler_list *list, const char *name, void *func, void *arg, int priority) argument 165 vimage_eventhandler_register(struct eventhandler_list *list, const char *name, void *func, void *arg, int priority, vimage_iterator_func_t iterfunc) argument 184 eventhandler_deregister(struct eventhandler_list *list, eventhandler_tag tag) argument 229 struct eventhandler_list *list; local 245 struct eventhandler_list *list; local 264 eventhandler_prune_list(struct eventhandler_list *list) argument [all...] |
/freebsd-9.3-release/lib/libc/include/isc/ |
H A D | list.h | 30 #define INIT_LIST(list) \ 31 do { (list).head = NULL; (list).tail = NULL; } while (0) 43 #define HEAD(list) ((list).head) 44 #define TAIL(list) ((list).tail) 45 #define EMPTY(list) ((list).head == NULL) 47 #define PREPEND(list, el [all...] |
/freebsd-9.3-release/contrib/bind9/bin/named/ |
H A D | listenlist.c | 32 destroy(ns_listenlist_t *list); 60 ns_listenlist_t *list = NULL; local 62 list = isc_mem_get(mctx, sizeof(*list)); 63 if (list == NULL) 65 list->mctx = mctx; 66 list->refcount = 1; 67 ISC_LIST_INIT(list->elts); 68 *target = list; 73 destroy(ns_listenlist_t *list) { argument 94 ns_listenlist_t *list = *listp; local 109 ns_listenlist_t *list = NULL; local [all...] |
/freebsd-9.3-release/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-9.3-release/contrib/bind9/lib/lwres/include/lwres/ |
H A D | list.h | 18 /* $Id: list.h,v 1.14 2007/06/19 23:47:23 tbox Exp $ */ 23 /*! \file lwres/list.h */ 26 #define LWRES_LIST_INIT(list) \ 27 do { (list).head = NULL; (list).tail = NULL; } while (0) 38 #define LWRES_LIST_HEAD(list) ((list).head) 39 #define LWRES_LIST_TAIL(list) ((list).tail) 40 #define LWRES_LIST_EMPTY(list) LWRES_T [all...] |
/freebsd-9.3-release/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 40 * list in `list'. Return an error code. 44 string_to_list (krb5_context context, const char *s, krb5_realm **list) argument 47 *list = malloc (2 * sizeof(**list)); 48 if (*list == NULL) { 52 (*list)[0] = strdup (s); 53 if ((*list)[ [all...] |
/freebsd-9.3-release/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-9.3-release/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-9.3-release/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...] |
/freebsd-9.3-release/contrib/gperf/src/ |
H A D | keyword-list.cc | 1 /* Keyword list. 24 #include "keyword-list.h" 46 /* Copies a linear list, sharing the list elements. */ 48 copy_list (Keyword_List *list) argument 52 while (list != NULL) 54 Keyword_List *new_cons = new Keyword_List (list->first()); 57 list = list->rest(); 63 /* Copies a linear list, sharin 65 copy_list(KeywordExt_List *list) argument 72 delete_list(Keyword_List *list) argument 125 mergesort_list(Keyword_List *list, Keyword_Comparison less) argument 159 mergesort_list(KeywordExt_List *list, bool (*less) (KeywordExt *keyword1, KeywordExt *keyword2)) argument [all...] |
/freebsd-9.3-release/usr.bin/mklocale/ |
H A D | yacc.y | 13 * notice, this list of conditions and the following disclaimer. 15 * notice, this list of conditions and the following disclaimer in the 84 rune_list *list; 100 %type <list> list 101 %type <list> map 135 | LIST list 145 list : RUNE label 159 | list RUNE 166 | list RUN [all...] |