Searched refs:list (Results 51 - 75 of 1314) sorted by relevance

1234567891011>>

/freebsd-10.2-release/contrib/bmake/lst.lib/
H A DlstForEachFrom.c14 * notice, this list of conditions and the following disclaimer.
16 * notice, this list of conditions and the following disclaimer in the
50 * Perform a given function on all elements of a list starting from
59 * Apply the given function to each element of the given list. The
77 List list = l; local
82 if (!LstValid (list) || LstIsEmpty (list)) {
101 done = (next == NULL || next == list->firstPtr);
121 } while (!result && !LstIsEmpty(list) && !done);
H A DlstAppend.c14 * notice, this list of conditions and the following disclaimer.
16 * notice, this list of conditions and the following disclaimer in the
58 * Create a new node and add it to the given list after the given node.
61 * l affected list
71 * list. lastPtr and firstPtr will alter if the list was empty and
79 List list; local
92 list = l;
100 if (list->isCirc) {
105 list
[all...]
H A DlstInsert.c14 * notice, this list of conditions and the following disclaimer.
16 * notice, this list of conditions and the following disclaimer in the
59 * node in the given list.
62 * l list to manipulate
71 * list.
80 List list = l; local
100 if (list->isCirc) {
105 list->firstPtr = list->lastPtr = nLNode;
115 if (lNode == list
[all...]
/freebsd-10.2-release/contrib/libucl/uthash/
H A Dutlist.h9 notice, this list of conditions and the following disclaimer.
40 * Either way, the pointer to the head of the list must be initialized to NULL.
48 * struct item *list = NULL:
53 * DL_APPEND(list, item);
81 * namely, we always reassign our tmp variable to the list head if we need
84 #define _SV(elt,list) _tmp = (char*)(list); {char **_alias = (char**)&(list); *_alias = (elt); }
85 #define _NEXT(elt,list,next) ((char*)((list)
[all...]
/freebsd-10.2-release/sys/dev/hpt27xx/
H A Dhpt27xx_os_bsd.c11 * notice, this list of conditions and the following disclaimer.
13 * notice, this list of conditions and the following disclaimer in the
151 void freelist_reserve(struct freelist *list, void *osext, HPT_UINT size, HPT_UINT count) argument
158 list->next = vbus_ext->freelist_head;
159 vbus_ext->freelist_head = list;
160 list->dma = 0;
161 list->size = size;
162 list->head = 0;
164 list->reserved_count =
166 list
169 freelist_get(struct freelist *list) argument
182 freelist_put(struct freelist * list, void *p) argument
190 freelist_reserve_dma(struct freelist *list, void *osext, HPT_UINT size, HPT_UINT alignment, HPT_UINT count) argument
209 freelist_get_dma(struct freelist *list, BUS_ADDRESS *busaddr) argument
219 freelist_put_dma(struct freelist *list, void *p, BUS_ADDRESS busaddr) argument
[all...]
H A Dlist.h9 * notice, this list of conditions and the following disclaimer.
11 * notice, this list of conditions and the following disclaimer in the
26 * $FreeBSD: releng/10.2/sys/dev/hpt27xx/list.h 284879 2015-06-26 19:55:01Z delphij $
87 static HPT_INLINE void __list_splice(struct list_head *list, argument
90 struct list_head *first = list->next;
91 struct list_head *last = list->prev;
101 static HPT_INLINE void list_splice(struct list_head *list, struct list_head *head) argument
103 if (!list_empty(list))
104 __list_splice(list, head);
107 static HPT_INLINE void list_splice_init(struct list_head *list, struc argument
[all...]
/freebsd-10.2-release/sys/dev/hptnr/
H A Dhptnr_os_bsd.c11 * notice, this list of conditions and the following disclaimer.
13 * notice, this list of conditions and the following disclaimer in the
137 void freelist_reserve(struct freelist *list, void *osext, HPT_UINT size, HPT_UINT count) argument
144 list->next = vbus_ext->freelist_head;
145 vbus_ext->freelist_head = list;
146 list->dma = 0;
147 list->size = size;
148 list->head = 0;
150 list->reserved_count =
152 list
155 freelist_get(struct freelist *list) argument
168 freelist_put(struct freelist * list, void *p) argument
176 freelist_reserve_dma(struct freelist *list, void *osext, HPT_UINT size, HPT_UINT alignment, HPT_UINT count) argument
195 freelist_get_dma(struct freelist *list, BUS_ADDRESS *busaddr) argument
205 freelist_put_dma(struct freelist *list, void *p, BUS_ADDRESS busaddr) argument
[all...]
H A Dlist.h1 /* $Id: list.h,v 1.6 2006/10/31 06:25:28 gmm Exp $ */
10 * notice, this list of conditions and the following disclaimer.
12 * notice, this list of conditions and the following disclaimer in the
27 * $FreeBSD: releng/10.2/sys/dev/hptnr/list.h 252867 2013-07-06 07:49:41Z delphij $
86 static HPT_INLINE void __list_splice(struct list_head *list, argument
89 struct list_head *first = list->next;
90 struct list_head *last = list->prev;
100 static HPT_INLINE void list_splice(struct list_head *list, struct list_head *head) argument
102 if (!list_empty(list))
103 __list_splice(list, hea
106 list_splice_init(struct list_head *list, struct list_head *head) argument
[all...]
/freebsd-10.2-release/contrib/dialog/
H A Dfselect.c90 init_list(LIST * list, WINDOW *par, WINDOW *win, int mousex) argument
92 list->par = par;
93 list->win = win;
94 list->length = 0;
95 list->offset = 0;
96 list->choice = 0;
97 list->mousex = mousex;
98 list->allocd = 0;
99 list->data = 0;
117 data_of(LIST * list) argument
126 free_list(LIST * list, int reinit) argument
141 add_to_list(LIST * list, char *text) argument
160 keep_visible(LIST * list) argument
174 find_choice(char *target, LIST * list) argument
217 display_list(LIST * list) argument
268 fix_arrows(LIST * list) argument
294 show_list(char *target, LIST * list, int keep) argument
317 change_list(int choice, LIST * list) argument
336 scroll_list(int direction, LIST * list) argument
[all...]
/freebsd-10.2-release/lib/libutil/
H A Dproperty.c3 * Simple property list handling code.
12 * notice, this list of conditions and the following disclaimer,
16 * notice, this list of conditions and the following disclaimer in the
233 property_find(properties list, const char *name) argument
235 if (list == NULL || name == NULL || !name[0])
237 while (list != NULL) {
238 if (list->name != NULL && strcmp(list->name, name) == 0)
239 return (list->value);
240 list
246 properties_free(properties list) argument
[all...]
/freebsd-10.2-release/contrib/serf/buckets/
H A Daggregate_buckets.c27 bucket_list_t *list; /* active buckets */ member in struct:__anon4525
28 bucket_list_t *last; /* last bucket of the list */
73 ctx->list = NULL;
114 while (ctx->list) {
116 serf_bucket_destroy(ctx->list->bucket);
118 next_ctx = ctx->list->next;
119 serf_bucket_mem_free(bucket->allocator, ctx->list);
120 ctx->list = next_ctx;
150 new_list->next = ctx->list;
152 ctx->list
[all...]
/freebsd-10.2-release/lib/libmemstat/
H A Dmemstat_malloc.c9 * notice, this list of conditions and the following disclaimer.
11 * notice, this list of conditions and the following disclaimer in the
55 * type information in the passed list. For each type, check the list for an
57 * entry. Otherwise, add a new entry. On error, the entire list will be
60 * To reduce the level of work for a list that starts empty, we keep around a
62 * the list for entries to update. Updates are O(n^2) due to searching for
66 memstat_sysctl_malloc(struct memory_type_list *list, int flags) argument
76 hint_dontsearch = LIST_EMPTY(&list->mtl_list);
89 list
281 memstat_kvm_malloc(struct memory_type_list *list, void *kvm_handle) argument
[all...]
H A Dmemstat_uma.c9 * notice, this list of conditions and the following disclaimer.
11 * notice, this list of conditions and the following disclaimer in the
64 * type information in the passed list. For each type, check the list for an
66 * entry. Otherwise, add a new entry. On error, the entire list will be
69 * To reduce the level of work for a list that starts empty, we keep around a
71 * the list for entries to update. Updates are O(n^2) due to searching for
75 memstat_sysctl_uma(struct memory_type_list *list, int flags) argument
85 hint_dontsearch = LIST_EMPTY(&list->mtl_list);
98 list
296 memstat_kvm_uma(struct memory_type_list *list, void *kvm_handle) argument
[all...]
H A Dmemstat.h9 * notice, this list of conditions and the following disclaimer.
11 * notice, this list of conditions and the following disclaimer in the
61 * struct memory_type_list, and accessed via memstat_get_error(list).
82 * struct memory_type_list is the head of a list of memory types and
89 * Functions that operate without memory type or memory type list context.
97 struct memory_type *memstat_mtl_first(struct memory_type_list *list);
99 struct memory_type *memstat_mtl_find(struct memory_type_list *list,
101 void memstat_mtl_free(struct memory_type_list *list);
102 int memstat_mtl_geterror(struct memory_type_list *list);
107 int memstat_sysctl_all(struct memory_type_list *list, in
[all...]
/freebsd-10.2-release/contrib/binutils/gas/
H A Dlisting.c47 .list
70 down, the listing is output. This is done by running down the list of
146 /* Next in list. */
522 listing_page (list_info_type *list) argument
535 while (c != 0 && list)
537 if (list->edict == EDICT_SBTTL && !had_subtitle)
540 subtitle = list->edict_arg;
542 if (list->edict == EDICT_TITLE && !had_title)
545 title = list->edict_arg;
547 list
565 calc_hex(list_info_type *list) argument
633 print_lines(list_info_type *list, unsigned int lineno, char *string, unsigned int address) argument
845 print_source(file_info_type *current_file, list_info_type *list, char *buffer, unsigned int width) argument
867 debugging_pseudo(list_info_type *list, const char *line) argument
938 list_info_type *list = head; local
[all...]
/freebsd-10.2-release/contrib/apr-util/buckets/
H A Dapr_buckets_eos.c37 APU_DECLARE(apr_bucket *) apr_bucket_eos_create(apr_bucket_alloc_t *list) argument
39 apr_bucket *b = apr_bucket_alloc(sizeof(*b), list);
43 b->list = list;
H A Dapr_buckets_flush.c37 APU_DECLARE(apr_bucket *) apr_bucket_flush_create(apr_bucket_alloc_t *list) argument
39 apr_bucket *b = apr_bucket_alloc(sizeof(*b), list);
43 b->list = list;
/freebsd-10.2-release/sys/dev/isci/scil/
H A Dsci_base_iterator.c34 * notice, this list of conditions and the following disclaimer.
36 * notice, this list of conditions and the following disclaimer in
104 * @param[in] list This parameter specifies the abstract list that will be
106 * to point to the first element in this abstract list.
112 SCI_ABSTRACT_LIST_T * list
118 iterator->list = list;
147 * @brief Modify the iterator to point to the first element in the list.
159 iterator->current = sci_abstract_list_get_front(iterator->list);
[all...]
/freebsd-10.2-release/sys/cddl/contrib/opensolaris/uts/common/sys/
H A Dlist_impl.h43 struct list { struct
/freebsd-10.2-release/usr.bin/rpcgen/
H A Drpc_util.h76 struct list { struct
78 struct list *next;
80 typedef struct list list; typedef in typeref:struct:list
120 extern list *defined;
157 void storeval(list **lstp, definition *val);
163 #define STOREVAL(list,item) \
164 storeval(list,item)
166 definition *findval(list *lst, const char *val, int (*cmp)(definition *, const char *));
168 #define FINDVAL(list,ite
[all...]
/freebsd-10.2-release/usr.sbin/mptutil/
H A Dmpt_drive.c10 * notice, this list of conditions and the following disclaimer.
12 * notice, this list of conditions and the following disclaimer in the
89 * - IOC2 : This gives us a list of volumes, and by walking the volumes we
92 * - IOC3 : This gives us a list of all online physical drives including
95 * - IOC5 : This gives us a list of all spare drives including failed
105 * drive is already present in the list. It also sorts the list as it
109 mpt_pd_insert(int fd, struct mpt_drive_list *list, U8 PhysDiskNum) argument
117 for (i = 0; i < list->ndrives; i++) {
118 if (list
148 struct mpt_drive_list *list; local
230 mpt_free_pd_list(struct mpt_drive_list *list) argument
240 mpt_lookup_drive(struct mpt_drive_list *list, const char *drive, U8 *PhysDiskNum) argument
313 struct mpt_drive_list *list; local
[all...]
/freebsd-10.2-release/contrib/atf/atf-c/detail/
H A Dlist.h8 * notice, this list of conditions and the following disclaimer.
10 * notice, this list of conditions and the following disclaimer in the
102 #define atf_list_for_each(iter, list) \
103 for (iter = atf_list_begin(list); \
104 !atf_equal_list_iter_list_iter((iter), atf_list_end(list)); \
106 #define atf_list_for_each_c(iter, list) \
107 for (iter = atf_list_begin_c(list); \
108 !atf_equal_list_citer_list_citer((iter), atf_list_end_c(list)); \
/freebsd-10.2-release/contrib/gdb/gdb/
H A Dcompleter.c61 /* When completing on command names, we remove '-' from the list of
69 /* When completing on file names, we remove from the list of word
204 char ** list = NULL;
275 list = make_file_symbol_completion_list (symbol_start, word,
281 list = make_symbol_completion_list (symbol_start, word);
292 if (list)
293 for ( ; list[n_syms]; n_syms++)
296 /* Make list[] large enough to hold both lists, then catenate
297 fn_list[] onto the end of list[]. */
300 list
203 char ** list = NULL; local
381 char **list = NULL; local
628 static char **list = (char **) NULL; /* Cache of completions */ local
[all...]
/freebsd-10.2-release/sys/dev/hptrr/
H A Dlist.h9 * notice, this list of conditions and the following disclaimer.
11 * notice, this list of conditions and the following disclaimer in the
26 * $FreeBSD: releng/10.2/sys/dev/hptrr/list.h 174604 2007-12-15 00:56:17Z scottl $
30 * $Id: list.h,v 1.6 2006/10/31 06:25:28 gmm Exp $
89 static HPT_INLINE void __list_splice(struct list_head *list, argument
92 struct list_head *first = list->next;
93 struct list_head *last = list->prev;
103 static HPT_INLINE void list_splice(struct list_head *list, struct list_head *head) argument
105 if (!list_empty(list))
106 __list_splice(list, hea
109 list_splice_init(struct list_head *list, struct list_head *head) argument
[all...]
/freebsd-10.2-release/contrib/binutils/binutils/
H A Darparse.y39 struct list *list ;
62 %type <list> modulelist
63 %type <list> modulename
173 { struct list *n = (struct list *) malloc(sizeof(struct list));

Completed in 373 milliseconds

1234567891011>>