| /netbsd/external/gpl2/gettext/dist/gettext-tools/gnulib-lib/ |
| H A D | gl_list.c | 55 ->size (list); in gl_list_size()
69 ->next_node (list, node); in gl_list_next_node()
96 size_t size = ((const struct gl_list_impl_base *) list)->vtable->size (list); in gl_list_search()
104 size_t size = ((const struct gl_list_impl_base *) list)->vtable->size (list); in gl_list_search_from()
119 size_t size = ((const struct gl_list_impl_base *) list)->vtable->size (list); in gl_list_indexof()
127 size_t size = ((const struct gl_list_impl_base *) list)->vtable->size (list); in gl_list_indexof_from()
143 ->add_first (list, elt); in gl_list_add_first()
150 ->add_last (list, elt); in gl_list_add_last()
192 ->remove (list, elt); in gl_list_remove()
198 ((const struct gl_list_impl_base *) list)->vtable->list_free (list); in gl_list_free()
[all …]
|
| H A D | gl_list.h | 259 gl_list_t list; member
469 ->size (list); in gl_list_size()
516 size_t size = ((const struct gl_list_impl_base *) list)->vtable->size (list); in gl_list_search()
525 size_t size = ((const struct gl_list_impl_base *) list)->vtable->size (list); in gl_list_search_from()
543 size_t size = ((const struct gl_list_impl_base *) list)->vtable->size (list); in gl_list_indexof()
552 size_t size = ((const struct gl_list_impl_base *) list)->vtable->size (list); in gl_list_indexof_from()
571 ->add_first (list, elt); in gl_list_add_first()
579 ->add_last (list, elt); in gl_list_add_last()
627 ->remove (list, elt); in gl_list_remove()
634 ((const struct gl_list_impl_base *) list)->vtable->list_free (list); in gl_list_free()
[all …]
|
| H A D | gl_anylinked_list2.h | 55 list->table = in gl_linked_create_empty()
58 list->root.next = &list->root; in gl_linked_create_empty()
59 list->root.prev = &list->root; in gl_linked_create_empty()
60 list->count = 0; in gl_linked_create_empty()
62 return list; in gl_linked_create_empty()
86 list->table = in gl_linked_create()
117 return list; in gl_linked_create()
764 for (node = list->root.next; node != &list->root; ) in gl_linked_list_free()
773 free (list); in gl_linked_list_free()
784 result.list = list; in gl_linked_iterator()
[all …]
|
| /netbsd/external/gpl2/gettext/dist/gettext-tools/src/ |
| H A D | format-lisp.c | 40 #define VERIFY_LIST(list) verify_list (list) argument
184 #define VERIFY_LIST(list) verify_list (list) argument
227 newelement->list = copy_list (oldelement->list); in copy_element()
964 re->list = copy_list (e2->list); in make_intersected_element()
970 re->list = copy_list (e1->list); in make_intersected_element()
1063 list->initial.length = list->initial.length + list->repeated.length; in append_repeated_to_initial()
1981 list->initial.element[s].list = tmpelement.list; in add_type_constraint()
2018 list->initial.element[s].list = tmpelement.list; in add_listtype_constraint()
2227 list = backtrack_in_initial (list); in make_repeated_list()
3172 list = union (list, sub_escape); in parse_upto()
[all …]
|
| H A D | format-scheme.c | 42 #define VERIFY_LIST(list) verify_list (list) argument
187 #define VERIFY_LIST(list) verify_list (list) argument
230 newelement->list = copy_list (oldelement->list); in copy_element()
967 re->list = copy_list (e2->list); in make_intersected_element()
973 re->list = copy_list (e1->list); in make_intersected_element()
1076 list->initial.length = list->initial.length + list->repeated.length; in append_repeated_to_initial()
2004 list->initial.element[s].list = tmpelement.list; in add_type_constraint()
2041 list->initial.element[s].list = tmpelement.list; in add_listtype_constraint()
2250 list = backtrack_in_initial (list); in make_repeated_list()
2835 (list != NULL ? copy_list (list) : NULL); in parse_upto()
[all …]
|
| /netbsd/usr.bin/mklocale/ |
| H A D | yacc.y | 124 %type <list> list
622 for(list = types.root; list; list = list->next) { in dump_tables()
652 list = list->next; in dump_tables()
662 list = list->next; in dump_tables()
672 list = list->next; in dump_tables()
689 for (list = types.root, n = 0; list != NULL; list = list->next, n++) { in dump_tables()
731 for (list = types.root, n = 0; list != NULL; list = list->next, n++) { in dump_tables()
776 for (list = maplower.root; list; list = list->next) in dump_tables()
795 for (list = mapupper.root; list; list = list->next) in dump_tables()
828 for (list = types.root; list; list = list->next) { in dump_tables()
[all …]
|
| /netbsd/external/gpl2/groff/dist/src/preproc/eqn/ |
| H A D | list.cpp | 40 list.append(pp); in append()
43 list.append(q->list.p[i]); in append()
46 q->list.len = 0; in append()
56 list.p[0] = q->list.p[0]; in list_box()
58 list.append(q->list.p[i]); in list_box()
61 q->list.len = 0; in list_box()
120 if (i + 1 < list.len && list.p[i + 1]->left_is_italic()) in compute_metrics()
204 if (list.p[list.len-1]->is_simple()) in compute_subscript_kern()
205 list.p[list.len-1]->compute_metrics(sty); in compute_subscript_kern()
206 list.p[list.len-1]->compute_subscript_kern(); in compute_subscript_kern()
[all …]
|
| /netbsd/external/ibm-public/postfix/dist/src/util/ |
| H A D | inet_addr_list.c | 72 list->used = 0; in inet_addr_list_init()
73 list->size = 0; in inet_addr_list_init()
94 if (list->used >= list->size) { in inet_addr_list_append()
97 myrealloc((void *) list->addrs, sizeof(*list->addrs) * new_size); in inet_addr_list_append()
98 list->size = new_size; in inet_addr_list_append()
100 memcpy(list->addrs + list->used++, addr, SOCK_ADDR_LEN(addr)); in inet_addr_list_append()
124 qsort((void *) list->addrs, list->used, in inet_addr_list_uniq()
133 list->addrs[n] = list->addrs[m]; in inet_addr_list_uniq()
139 list->used = n; in inet_addr_list_uniq()
162 for (sa = list->addrs; sa < list->addrs + list->used; sa++) { in inet_addr_list_print()
[all …]
|
| H A D | match_list.c | 202 MATCH_LIST *list; in match_list_init() local
210 list = (MATCH_LIST *) mymalloc(sizeof(*list)); in match_list_init()
214 list->match_func = in match_list_init()
216 list->match_args = in match_list_init()
222 list->error = 0; in match_list_init()
228 list->patterns = match_list_parse(list, argv_alloc(1), saved_patterns, in match_list_init()
232 return (list); in match_list_init()
249 va_start(ap, list); in match_list_match()
254 list->error = 0; in match_list_match()
259 casefold(list->fold_buf, list->match_args[i]); in match_list_match()
[all …]
|
| /netbsd/external/cddl/osnet/dist/uts/common/os/ |
| H A D | list.c | 70 ASSERT(list); in list_create()
74 list->list_size = size; in list_create()
76 list->list_head.list_next = list->list_head.list_prev = in list_create()
77 &list->list_head; in list_create()
85 ASSERT(list); in list_destroy()
158 list_head(list_t *list) in list_head() argument
160 if (list_empty(list)) in list_head()
162 return (list_object(list, list->list_head.list_next)); in list_head()
166 list_tail(list_t *list) in list_tail() argument
168 if (list_empty(list)) in list_tail()
[all …]
|
| /netbsd/external/ibm-public/postfix/dist/src/global/ |
| H A D | recipient_list.c | 147 if (list->len >= list->avail) { in recipient_list_add()
153 list->info[list->len].orig_addr = mystrdup(orig_rcpt); in recipient_list_add()
154 list->info[list->len].address = mystrdup(rcpt); in recipient_list_add()
155 list->info[list->len].offset = offset; in recipient_list_add()
156 list->info[list->len].dsn_orcpt = mystrdup(dsn_orcpt); in recipient_list_add()
157 list->info[list->len].dsn_notify = dsn_notify; in recipient_list_add()
159 list->info[list->len].u.status = 0; in recipient_list_add()
161 list->info[list->len].u.queue = 0; in recipient_list_add()
163 list->info[list->len].u.addr_type = 0; in recipient_list_add()
164 list->len++; in recipient_list_add()
[all …]
|
| /netbsd/external/bsd/ntp/dist/lib/isc/include/isc/ |
| H A D | list.h | 34 #define ISC_LIST_INIT(list) \ argument
35 do { (list).head = NULL; (list).tail = NULL; } while (0)
47 #define ISC_LIST_HEAD(list) ((list).head) argument
48 #define ISC_LIST_TAIL(list) ((list).tail) argument
49 #define ISC_LIST_EMPTY(list) ISC_TF((list).head == NULL) argument
53 if ((list).head != NULL) \
56 (list).tail = (elt); \
59 (list).head = (elt); \
76 (list).head = (elt); \
79 (list).tail = (elt); \
[all …]
|
| /netbsd/external/mpl/bind/dist/lib/isc/include/isc/ |
| H A D | list.h | 43 #define ISC_LIST_INIT(list) \ argument
45 (list).head = NULL; \
46 (list).tail = NULL; \
63 #define ISC_LIST_HEAD(list) ((list).head) argument
64 #define ISC_LIST_TAIL(list) ((list).tail) argument
65 #define ISC_LIST_EMPTY(list) ((list).head == NULL) argument
70 (list).head->link.prev = (elt); \
72 (list).tail = (elt); \
91 (list).tail->link.next = (elt); \
93 (list).head = (elt); \
[all …]
|
| /netbsd/external/bsd/atf/dist/atf-c/detail/ |
| H A D | list_test.c | 55 atf_list_t list; in ATF_TC_BODY() local
59 atf_list_fini(&list); in ATF_TC_BODY()
73 atf_list_t list; in ATF_TC_BODY() local
87 atf_list_fini(&list); in ATF_TC_BODY()
97 atf_list_t list; in ATF_TC_BODY() local
111 atf_list_fini(&list); in ATF_TC_BODY()
117 atf_list_t list; in ATF_TC_BODY() local
131 atf_list_t list; in ATF_TC_BODY() local
163 atf_list_t list; in ATF_TC_BODY() local
273 atf_list_t list; in ATF_TC_BODY() local
[all …]
|
| /netbsd/external/bsd/wpa/dist/src/utils/ |
| H A D | list.h | 24 list->next = list; in dl_list_init()
25 list->prev = list; in dl_list_init()
30 item->next = list->next; in dl_list_add()
31 item->prev = list; in dl_list_add()
32 list->next->prev = item; in dl_list_add()
33 list->next = item; in dl_list_add()
38 dl_list_add(list->prev, item); in dl_list_add_tail()
51 return list->next == list; in dl_list_empty()
58 for (item = list->next; item != list; item = item->next) in dl_list_len()
86 &item->member != (list); \
[all …]
|
| /netbsd/external/bsd/libbind/dist/include/isc/ |
| H A D | list.h | 25 #define INIT_LIST(list) \ argument
26 do { (list).head = NULL; (list).tail = NULL; } while (0)
39 #define HEAD(list) ((list).head) argument
40 #define TAIL(list) ((list).tail) argument
41 #define EMPTY(list) ((list).head == NULL) argument
49 (list).tail = (elt); \
52 (list).head = (elt); \
61 (list).head = (elt); \
64 (list).tail = (elt); \
116 #define ENQUEUE(list, elt, link) APPEND(list, elt, link) argument
[all …]
|
| /netbsd/lib/libc/include/isc/ |
| H A D | list.h | 25 #define INIT_LIST(list) \ argument
26 do { (list).head = NULL; (list).tail = NULL; } while (0)
39 #define HEAD(list) ((list).head) argument
40 #define TAIL(list) ((list).tail) argument
41 #define EMPTY(list) ((list).head == NULL) argument
49 (list).tail = (elt); \
52 (list).head = (elt); \
61 (list).head = (elt); \
64 (list).tail = (elt); \
116 #define ENQUEUE(list, elt, link) APPEND(list, elt, link) argument
[all …]
|
| /netbsd/external/gpl2/xcvs/dist/src/ |
| H A D | hash.c | 58 List *list; in getlist() local
64 list = listcache; in getlist()
76 list->list = node; in getlist()
80 return list; in getlist()
326 return insert_before (list, list->list, p); in addnode()
338 return insert_before (list, list->list->next, p); in addnode_at_front()
419 head = list->list; in walklist()
430 return list == NULL || list->list->next == list->list; in list_isempty()
460 head = list->list; in sortlist()
576 (void *) list, (void *) list->list, HASHSIZE, (void *) list->next); in printlist()
[all …]
|
| /netbsd/external/cddl/osnet/dist/tools/ctf/common/ |
| H A D | list.c | 44 struct list { struct
46 struct list *l_next; argument
57 le->l_next = *list; in list_add()
58 *list = le; in list_add()
109 while (list) { in list_free()
110 le = list; in list_free()
111 list = list->l_next; in list_free()
129 while (list) { in list_iter()
134 list = lnext; in list_iter()
162 for (; list; list = list->l_next) { in list_find()
[all …]
|
| /netbsd/crypto/external/cpl/trousers/dist/src/tspi/daa/utils/ |
| H A D | list.c | 20 if( list == NULL) return NULL; in list_new()
21 list->head = NULL; in list_new()
22 return list; in list_new()
27 if (list->current == NULL) { in list_add()
31 if( list->head == NULL) { in list_add()
32 list->head = list->current; in list_add()
34 list->previous->next = list->current; in list_add()
35 list->current->obj = obj; in list_add()
36 list->current->next = NULL; in list_add()
37 list->previous = list->current; in list_add()
[all …]
|
| /netbsd/usr.bin/make/ |
| H A D | lst.c | 55 List *list = bmake_malloc(sizeof *list); in Lst_New() local
56 Lst_Init(list); in Lst_New()
57 return list; in Lst_New()
88 Lst_Done(list); in Lst_Free()
89 free(list); in Lst_Free()
121 list->first = ln; in Lst_Prepend()
122 list->last = ln; in Lst_Prepend()
125 list->first = ln; in Lst_Prepend()
141 list->last = ln; in Lst_Append()
144 list->last = ln; in Lst_Append()
[all …]
|
| /netbsd/external/mpl/dhcp/dist/server/ |
| H A D | leasechain.c | 118 return (lc->list)[0]; in lc_get_first_lease()
255 if (lp == lc->list[i]) { in lc_binary_search_lease()
324 if (lc->list != NULL) { in lc_grow_chain()
326 dfree(lc->list, MDL); in lc_grow_chain()
370 memmove(lc->list + n + 1, lc->list + n, in lc_link_lcp()
377 lc->list[n] = NULL; in lc_link_lcp()
570 lc->list[n]->lc = NULL; in lc_unlink_lcp()
577 memmove(lc->list + n, lc->list + n + 1, in lc_unlink_lcp()
678 if (lc->list != NULL) { in lc_delete_all()
679 dfree(lc->list, MDL); in lc_delete_all()
[all …]
|
| /netbsd/external/gpl3/gdb/dist/binutils/ |
| H A D | arsup.c | 52 if (list == NULL) in map_over_list()
103 ar_directory (char *ar_name, struct list *list, char *output) in ar_directory() argument
233 ar_addlib (char *name, struct list *list) in ar_addlib() argument
253 ar_addmod (struct list *list) in ar_addmod() argument
282 list = list->next; in ar_addmod()
296 ar_delete (struct list *list) in ar_delete() argument
332 list = list->next; in ar_delete()
361 ar_replace (struct list *list) in ar_replace() argument
420 list = list->next; in ar_replace()
460 ar_extract (struct list *list) in ar_extract() argument
[all …]
|
| /netbsd/external/gpl3/binutils.old/dist/binutils/ |
| H A D | arsup.c | 52 if (list == NULL) in map_over_list()
103 ar_directory (char *ar_name, struct list *list, char *output) in ar_directory() argument
233 ar_addlib (char *name, struct list *list) in ar_addlib() argument
253 ar_addmod (struct list *list) in ar_addmod() argument
282 list = list->next; in ar_addmod()
296 ar_delete (struct list *list) in ar_delete() argument
332 list = list->next; in ar_delete()
361 ar_replace (struct list *list) in ar_replace() argument
420 list = list->next; in ar_replace()
460 ar_extract (struct list *list) in ar_extract() argument
[all …]
|
| /netbsd/external/gpl3/binutils/dist/binutils/ |
| H A D | arsup.c | 54 if (list == NULL) in map_over_list()
105 ar_directory (char *ar_name, struct list *list, char *output) in ar_directory() argument
236 ar_addlib (char *name, struct list *list) in ar_addlib() argument
256 ar_addmod (struct list *list) in ar_addmod() argument
285 list = list->next; in ar_addmod()
299 ar_delete (struct list *list) in ar_delete() argument
335 list = list->next; in ar_delete()
379 ar_replace (struct list *list) in ar_replace() argument
438 list = list->next; in ar_replace()
478 ar_extract (struct list *list) in ar_extract() argument
[all …]
|