| /dports/misc/xtail/xtail-2.1/ |
| H A D | entryfuncs.c | 24 listp->num_entries = 0; in new_entry_list()
26 listp->chunk = chunk; in new_entry_list()
27 return listp; in new_entry_list()
34 if (listp->num_entries >= listp->max_entries) { in E_append()
35 listp->max_entries += listp->chunk; in E_append()
36 listp->list = safe_realloc(listp->list, in E_append()
39 listp->list[listp->num_entries++] = entryp; in E_append()
48 listp->list[entryno-1] = listp->list[entryno]; in E_remove()
49 --listp->num_entries; in E_remove()
91 listp->list[entryno]->name, list_name(listp)); in rmv_entry()
[all …]
|
| /dports/mail/dovecot/dovecot-2.3.17/src/dict/ |
| H A D | dict-init-cache.c | 58 while (listp != NULL) { in dict_init_cache_find()
64 match = listp; in dict_init_cache_find()
66 if (listp->refcount == 0 && listp != match) { in dict_init_cache_find()
103 for (listp = dicts; listp != NULL; listp = next) { in destroy_unrefed()
104 next = listp->next; in destroy_unrefed()
107 if (listp->refcount > 0) in destroy_unrefed()
133 for (listp = dicts; listp != NULL; listp = listp->next) { in dict_init_cache_unref()
138 i_assert(listp != NULL && listp->dict == dict); in dict_init_cache_unref()
141 listp->refcount--; in dict_init_cache_unref()
155 for (listp = dicts; listp != NULL; listp = listp->next) in dict_init_cache_wait_all()
[all …]
|
| /dports/irc/unreal/Unreal3.2.10.7/src/ |
| H A D | fdlist.c | 60 if (listp->entry[i] == fd) in addto_fdlist()
77 --listp->last_entry; in addto_fdlist()
82 listp->entry[index] = fd; in addto_fdlist()
108 if (listp->entry[i] == fd) in delfrom_fdlist()
137 listp->entry[i] = 0; in delfrom_fdlist()
138 listp->last_entry--; in delfrom_fdlist()
143 listp->entry[i] = listp->entry[listp->last_entry]; in delfrom_fdlist()
144 listp->entry[listp->last_entry] = 0; in delfrom_fdlist()
145 listp->last_entry--; in delfrom_fdlist()
152 listp->last_entry = 0; in init_fdlist()
[all …]
|
| /dports/devel/aarch64-none-elf-gcc/gcc-8.4.0/gcc/ |
| H A D | lists.c | 45 prev_link = *listp; in free_list()
61 *unused_listp = *listp; in free_list()
62 *listp = 0; in free_list()
71 listp = &XEXP (*listp, 1); in find_list_elem()
72 return listp; in find_list_elem()
81 node = *listp; in remove_list_node()
82 *listp = XEXP (node, 1); in remove_list_node()
93 listp = find_list_elem (elem, listp); in remove_list_elem()
94 node = *listp; in remove_list_elem()
149 if (*listp == 0) in free_EXPR_LIST_list()
[all …]
|
| /dports/lang/gcc9/gcc-9.4.0/gcc/ |
| H A D | lists.c | 45 prev_link = *listp; in free_list()
61 *unused_listp = *listp; in free_list()
62 *listp = 0; in free_list()
71 listp = &XEXP (*listp, 1); in find_list_elem()
72 return listp; in find_list_elem()
81 node = *listp; in remove_list_node()
82 *listp = XEXP (node, 1); in remove_list_node()
93 listp = find_list_elem (elem, listp); in remove_list_elem()
94 node = *listp; in remove_list_elem()
149 if (*listp == 0) in free_EXPR_LIST_list()
[all …]
|
| /dports/devel/avr-gcc/gcc-10.2.0/gcc/ |
| H A D | lists.c | 45 prev_link = *listp; in free_list()
61 *unused_listp = *listp; in free_list()
62 *listp = 0; in free_list()
71 listp = &XEXP (*listp, 1); in find_list_elem()
72 return listp; in find_list_elem()
81 node = *listp; in remove_list_node()
82 *listp = XEXP (node, 1); in remove_list_node()
93 listp = find_list_elem (elem, listp); in remove_list_elem()
94 node = *listp; in remove_list_elem()
149 if (*listp == 0) in free_EXPR_LIST_list()
[all …]
|
| /dports/devel/riscv64-gcc/gcc-8.3.0/gcc/ |
| H A D | lists.c | 45 prev_link = *listp; in free_list()
61 *unused_listp = *listp; in free_list()
62 *listp = 0; in free_list()
71 listp = &XEXP (*listp, 1); in find_list_elem()
72 return listp; in find_list_elem()
81 node = *listp; in remove_list_node()
82 *listp = XEXP (node, 1); in remove_list_node()
93 listp = find_list_elem (elem, listp); in remove_list_elem()
94 node = *listp; in remove_list_elem()
149 if (*listp == 0) in free_EXPR_LIST_list()
[all …]
|
| /dports/lang/gnat_util/gcc-6-20180516/gcc/ |
| H A D | lists.c | 45 prev_link = *listp; in free_list()
61 *unused_listp = *listp; in free_list()
62 *listp = 0; in free_list()
71 listp = &XEXP (*listp, 1); in find_list_elem()
72 return listp; in find_list_elem()
81 node = *listp; in remove_list_node()
82 *listp = XEXP (node, 1); in remove_list_node()
93 listp = find_list_elem (elem, listp); in remove_list_elem()
94 node = *listp; in remove_list_elem()
149 if (*listp == 0) in free_EXPR_LIST_list()
[all …]
|
| /dports/lang/gcc11-devel/gcc-11-20211009/gcc/ |
| H A D | lists.c | 45 prev_link = *listp; in free_list()
61 *unused_listp = *listp; in free_list()
62 *listp = 0; in free_list()
71 listp = &XEXP (*listp, 1); in find_list_elem()
72 return listp; in find_list_elem()
81 node = *listp; in remove_list_node()
82 *listp = XEXP (node, 1); in remove_list_node()
93 listp = find_list_elem (elem, listp); in remove_list_elem()
94 node = *listp; in remove_list_elem()
149 if (*listp == 0) in free_EXPR_LIST_list()
[all …]
|
| /dports/lang/gcc48/gcc-4.8.5/gcc/ |
| H A D | lists.c | 47 prev_link = *listp; in free_list()
64 *listp = 0; in free_list()
73 listp = &XEXP (*listp, 1); in find_list_elem()
74 return listp; in find_list_elem()
83 node = *listp; in remove_list_node()
95 listp = find_list_elem (elem, listp); in remove_list_elem()
96 node = *listp; in remove_list_elem()
151 if (*listp == 0) in free_EXPR_LIST_list()
160 if (*listp == 0) in free_INSN_LIST_list()
225 rtx node = *listp; in remove_free_INSN_LIST_node()
[all …]
|
| /dports/lang/gcc10-devel/gcc-10-20211008/gcc/ |
| H A D | lists.c | 45 prev_link = *listp; in free_list()
61 *unused_listp = *listp; in free_list()
62 *listp = 0; in free_list()
71 listp = &XEXP (*listp, 1); in find_list_elem()
72 return listp; in find_list_elem()
81 node = *listp; in remove_list_node()
82 *listp = XEXP (node, 1); in remove_list_node()
93 listp = find_list_elem (elem, listp); in remove_list_elem()
94 node = *listp; in remove_list_elem()
149 if (*listp == 0) in free_EXPR_LIST_list()
[all …]
|
| /dports/devel/riscv32-unknown-elf-gcc/gcc-8.4.0/gcc/ |
| H A D | lists.c | 45 prev_link = *listp; in free_list()
61 *unused_listp = *listp; in free_list()
62 *listp = 0; in free_list()
71 listp = &XEXP (*listp, 1); in find_list_elem()
72 return listp; in find_list_elem()
81 node = *listp; in remove_list_node()
82 *listp = XEXP (node, 1); in remove_list_node()
93 listp = find_list_elem (elem, listp); in remove_list_elem()
94 node = *listp; in remove_list_elem()
149 if (*listp == 0) in free_EXPR_LIST_list()
[all …]
|
| /dports/devel/arm-none-eabi-gcc/gcc-8.4.0/gcc/ |
| H A D | lists.c | 45 prev_link = *listp; in free_list()
61 *unused_listp = *listp; in free_list()
62 *listp = 0; in free_list()
71 listp = &XEXP (*listp, 1); in find_list_elem()
72 return listp; in find_list_elem()
81 node = *listp; in remove_list_node()
82 *listp = XEXP (node, 1); in remove_list_node()
93 listp = find_list_elem (elem, listp); in remove_list_elem()
94 node = *listp; in remove_list_elem()
149 if (*listp == 0) in free_EXPR_LIST_list()
[all …]
|
| /dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/gcc/ |
| H A D | lists.c | 47 prev_link = *listp; in free_list()
64 *listp = 0; in free_list()
73 listp = &XEXP (*listp, 1); in find_list_elem()
74 return listp; in find_list_elem()
83 node = *listp; in remove_list_node()
95 listp = find_list_elem (elem, listp); in remove_list_elem()
96 node = *listp; in remove_list_elem()
151 if (*listp == 0) in free_EXPR_LIST_list()
160 if (*listp == 0) in free_INSN_LIST_list()
225 rtx node = *listp; in remove_free_INSN_LIST_node()
[all …]
|
| /dports/devel/riscv64-none-elf-gcc/gcc-8.4.0/gcc/ |
| H A D | lists.c | 45 prev_link = *listp; in free_list()
61 *unused_listp = *listp; in free_list()
62 *listp = 0; in free_list()
71 listp = &XEXP (*listp, 1); in find_list_elem()
72 return listp; in find_list_elem()
81 node = *listp; in remove_list_node()
82 *listp = XEXP (node, 1); in remove_list_node()
93 listp = find_list_elem (elem, listp); in remove_list_elem()
94 node = *listp; in remove_list_elem()
149 if (*listp == 0) in free_EXPR_LIST_list()
[all …]
|
| /dports/lang/gcc9-aux/gcc-9.1.0/gcc/ |
| H A D | lists.c | 45 prev_link = *listp; in free_list()
61 *unused_listp = *listp; in free_list()
62 *listp = 0; in free_list()
71 listp = &XEXP (*listp, 1); in find_list_elem()
72 return listp; in find_list_elem()
81 node = *listp; in remove_list_node()
82 *listp = XEXP (node, 1); in remove_list_node()
93 listp = find_list_elem (elem, listp); in remove_list_elem()
94 node = *listp; in remove_list_elem()
149 if (*listp == 0) in free_EXPR_LIST_list()
[all …]
|
| /dports/misc/cxx_atomics_pic/gcc-11.2.0/gcc/ |
| H A D | lists.c | 45 prev_link = *listp; in free_list()
61 *unused_listp = *listp; in free_list()
62 *listp = 0; in free_list()
71 listp = &XEXP (*listp, 1); in find_list_elem()
72 return listp; in find_list_elem()
81 node = *listp; in remove_list_node()
82 *listp = XEXP (node, 1); in remove_list_node()
93 listp = find_list_elem (elem, listp); in remove_list_elem()
94 node = *listp; in remove_list_elem()
149 if (*listp == 0) in free_EXPR_LIST_list()
[all …]
|
| /dports/lang/gcc10/gcc-10.3.0/gcc/ |
| H A D | lists.c | 45 prev_link = *listp; in free_list()
61 *unused_listp = *listp; in free_list()
62 *listp = 0; in free_list()
71 listp = &XEXP (*listp, 1); in find_list_elem()
72 return listp; in find_list_elem()
81 node = *listp; in remove_list_node()
82 *listp = XEXP (node, 1); in remove_list_node()
93 listp = find_list_elem (elem, listp); in remove_list_elem()
94 node = *listp; in remove_list_elem()
149 if (*listp == 0) in free_EXPR_LIST_list()
[all …]
|
| /dports/lang/gcc9-devel/gcc-9-20211007/gcc/ |
| H A D | lists.c | 45 prev_link = *listp; in free_list()
61 *unused_listp = *listp; in free_list()
62 *listp = 0; in free_list()
71 listp = &XEXP (*listp, 1); in find_list_elem()
72 return listp; in find_list_elem()
81 node = *listp; in remove_list_node()
82 *listp = XEXP (node, 1); in remove_list_node()
93 listp = find_list_elem (elem, listp); in remove_list_elem()
94 node = *listp; in remove_list_elem()
149 if (*listp == 0) in free_EXPR_LIST_list()
[all …]
|
| /dports/lang/gcc8/gcc-8.5.0/gcc/ |
| H A D | lists.c | 45 prev_link = *listp; in free_list()
61 *unused_listp = *listp; in free_list()
62 *listp = 0; in free_list()
71 listp = &XEXP (*listp, 1); in find_list_elem()
72 return listp; in find_list_elem()
81 node = *listp; in remove_list_node()
82 *listp = XEXP (node, 1); in remove_list_node()
93 listp = find_list_elem (elem, listp); in remove_list_elem()
94 node = *listp; in remove_list_elem()
149 if (*listp == 0) in free_EXPR_LIST_list()
[all …]
|
| /dports/lang/gcc11/gcc-11.2.0/gcc/ |
| H A D | lists.c | 45 prev_link = *listp; in free_list()
61 *unused_listp = *listp; in free_list()
62 *listp = 0; in free_list()
71 listp = &XEXP (*listp, 1); in find_list_elem()
72 return listp; in find_list_elem()
81 node = *listp; in remove_list_node()
82 *listp = XEXP (node, 1); in remove_list_node()
93 listp = find_list_elem (elem, listp); in remove_list_elem()
94 node = *listp; in remove_list_elem()
149 if (*listp == 0) in free_EXPR_LIST_list()
[all …]
|
| /dports/devel/mingw32-gcc/gcc-4.8.1/gcc/ |
| H A D | lists.c | 47 prev_link = *listp; in free_list()
64 *listp = 0; in free_list()
73 listp = &XEXP (*listp, 1); in find_list_elem()
74 return listp; in find_list_elem()
83 node = *listp; in remove_list_node()
95 listp = find_list_elem (elem, listp); in remove_list_elem()
96 node = *listp; in remove_list_elem()
151 if (*listp == 0) in free_EXPR_LIST_list()
160 if (*listp == 0) in free_INSN_LIST_list()
225 rtx node = *listp; in remove_free_INSN_LIST_node()
[all …]
|
| /dports/lang/gcc12-devel/gcc-12-20211205/gcc/ |
| H A D | lists.c | 45 prev_link = *listp; in free_list()
61 *unused_listp = *listp; in free_list()
62 *listp = 0; in free_list()
71 listp = &XEXP (*listp, 1); in find_list_elem()
72 return listp; in find_list_elem()
81 node = *listp; in remove_list_node()
82 *listp = XEXP (node, 1); in remove_list_node()
93 listp = find_list_elem (elem, listp); in remove_list_elem()
94 node = *listp; in remove_list_elem()
149 if (*listp == 0) in free_EXPR_LIST_list()
[all …]
|
| /dports/lang/gcc6-aux/gcc-6-20180516/gcc/ |
| H A D | lists.c | 45 prev_link = *listp; in free_list()
61 *unused_listp = *listp; in free_list()
62 *listp = 0; in free_list()
71 listp = &XEXP (*listp, 1); in find_list_elem()
72 return listp; in find_list_elem()
81 node = *listp; in remove_list_node()
82 *listp = XEXP (node, 1); in remove_list_node()
93 listp = find_list_elem (elem, listp); in remove_list_elem()
94 node = *listp; in remove_list_elem()
149 if (*listp == 0) in free_EXPR_LIST_list()
[all …]
|
| /dports/news/newsfish/newsfish-1.2.6/ |
| H A D | dlist.h | 38 #define DLIST_LIST_HEAD(listp, type, field) (struct type *) ((char *) &(listp)->head - DLIST_OFFSET… argument
43 (listp)->head = DLIST_LIST_TAIL(listp, type, field); \
44 (listp)->dummy = 0; \
45 (listp)->tail = DLIST_LIST_HEAD(listp, type, field); \
67 #define DLIST_ADD_HEAD(listp, nodep, field) DLIST_INSERT_BEFORE((listp)->head, nodep, field) argument
69 #define DLIST_ADD_TAIL(listp, nodep, field) DLIST_INSERT_AFTER((listp)->tail, nodep, field) argument
78 #define DLIST_EMPTY(listp, field) !((listp)->head->field.next) argument
80 #define DLIST_HEAD(listp, field) ((listp)->head->field.next ? (listp)->head : 0) argument
82 #define DLIST_TAIL(listp, field) ((listp)->tail->field.prev ? (listp)->tail : 0) argument
89 for ((nodep) = (listp)->head; \
[all …]
|