Searched refs:elt (Results 1 - 25 of 93) sorted by relevance

1234

/freebsd-11-stable/lib/libc/include/isc/
H A Dlist.h34 #define INIT_LINK_TYPE(elt, link, type) \
36 (elt)->link.prev = (type *)(-1); \
37 (elt)->link.next = (type *)(-1); \
39 #define INIT_LINK(elt, link) \
40 INIT_LINK_TYPE(elt, link, void)
41 #define LINKED(elt, link) ((void *)((elt)->link.prev) != (void *)(-1) && \
42 (void *)((elt)->link.next) != (void *)(-1))
48 #define PREPEND(list, elt, link) \
50 INSIST(!LINKED(elt, lin
[all...]
/freebsd-11-stable/contrib/ntp/lib/isc/include/isc/
H A Dlist.h36 #define ISC_LINK_INIT_TYPE(elt, link, type) \
38 (elt)->link.prev = (type *)(-1); \
39 (elt)->link.next = (type *)(-1); \
41 #define ISC_LINK_INIT(elt, link) \
42 ISC_LINK_INIT_TYPE(elt, link, void)
43 #define ISC_LINK_LINKED(elt, link) ((void *)((elt)->link.prev) != (void *)(-1))
49 #define __ISC_LIST_PREPENDUNSAFE(list, elt, link) \
52 (list).head->link.prev = (elt); \
54 (list).tail = (elt); \
[all...]
H A Dqueue.h38 #define ISC_QLINK_INIT(elt, link) \
40 (elt)->link.next = (void *)(-1); \
41 (elt)->link.linked = ISC_FALSE; \
43 #define ISC_QLINK_LINKED(elt, link) ((elt)->link.linked)
69 #define ISC_QUEUE_PUSH(queue, elt, link) \
71 ISC_QLINK_INSIST(!ISC_QLINK_LINKED(elt, link)); \
72 (elt)->link.next = (void *)(-1); \
74 (queue).tail->link.next = elt; \
75 (queue).tail = elt; \
[all...]
H A Dutil.h192 #define INIT_LINK(elt, link) ISC_LINK_INIT(elt, link)
196 #define PREV(elt, link) ISC_LIST_PREV(elt, link)
197 #define NEXT(elt, link) ISC_LIST_NEXT(elt, link)
198 #define APPEND(list, elt, link) ISC_LIST_APPEND(list, elt, link)
199 #define PREPEND(list, elt, link) ISC_LIST_PREPEND(list, elt, lin
[all...]
H A Dheap.h93 isc_heap_insert(isc_heap_t *heap, void *elt);
/freebsd-11-stable/contrib/ntp/lib/isc/
H A Dsymtab.c32 typedef struct elt { struct
36 LINK(struct elt) link;
100 elt_t *elt, *nelt; local
107 for (elt = HEAD(symtab->table[i]); elt != NULL; elt = nelt) {
108 nelt = NEXT(elt, link);
110 (symtab->undefine_action)(elt->key,
111 elt->type,
112 elt
172 elt_t *elt; local
207 elt_t *elt, *nelt; local
233 elt_t *elt; local
283 elt_t *elt; local
[all...]
H A Dheap.c146 float_up(isc_heap_t *heap, unsigned int i, void *elt) { argument
150 i > 1 && heap->compare(elt, heap->array[p]) ;
156 heap->array[i] = elt;
164 sink_down(isc_heap_t *heap, unsigned int i, void *elt) { argument
174 if (heap->compare(elt, heap->array[j]))
181 heap->array[i] = elt;
189 isc_heap_insert(isc_heap_t *heap, void *elt) { argument
200 float_up(heap, new_last, elt);
207 void *elt; local
217 elt
[all...]
/freebsd-11-stable/contrib/libucl/src/
H A Ducl_schema.c77 const ucl_object_t *elt; local
82 while ((elt = ucl_object_iterate (obj, &iter, true)) != NULL) {
83 if (regexec (&reg, ucl_object_key (elt), 0, NULL, 0) == 0) {
84 res = elt;
107 const ucl_object_t *elt, *cur, *cur_dep; local
112 elt = ucl_object_lookup (obj, ucl_object_key (cur));
113 if (elt != NULL) {
119 ucl_schema_create_error (err, UCL_SCHEMA_MISSING_DEPENDENCY, elt,
145 const ucl_object_t *elt, *prop, *found, *additional_schema = NULL, local
151 while (ret && (elt
294 const ucl_object_t *elt, *test; local
360 const ucl_object_t *elt; local
438 const ucl_object_t *elt; local
476 const ucl_object_t *elt, *it, *found, *additional_schema = NULL, local
596 const ucl_object_t *elt; local
652 const ucl_object_t *elt; local
873 const ucl_object_t *elt, *cur; local
922 const ucl_object_t *elt, *cur, *ref_root; local
[all...]
H A Ducl_hash.c258 struct ucl_hash_elt *elt; local
269 elt = &kh_value (h, k);
271 elt->obj = obj;
272 elt->ar_idx = kv_size (hashlin->ar) - 1;
280 elt = &kh_value (h, k);
282 elt->obj = obj;
283 elt->ar_idx = kv_size (hashlin->ar) - 1;
293 struct ucl_hash_elt elt, *pelt; local
304 elt = kh_value (h, k);
309 pelt->ar_idx = elt
384 struct ucl_hash_elt *elt; local
420 struct ucl_hash_elt *elt; local
[all...]
H A Ducl_util.c2141 ucl_object_insert_key_common (ucl_object_t *top, ucl_object_t *elt, argument
2150 if (elt == NULL || key == NULL) {
2179 elt->flags |= UCL_OBJECT_NEED_KEY_ESCAPE;
2185 if (elt->trash_stack[UCL_TRASH_KEY] != NULL &&
2186 key != (const char *)elt->trash_stack[UCL_TRASH_KEY]) {
2188 free (elt->trash_stack[UCL_TRASH_KEY]);
2189 elt->trash_stack[UCL_TRASH_KEY] = NULL;
2190 elt->flags &= ~UCL_OBJECT_ALLOCATED_KEY;
2193 elt->key = key;
2194 elt
2303 ucl_object_insert_key(ucl_object_t *top, ucl_object_t *elt, const char *key, size_t keylen, bool copy_key) argument
2310 ucl_object_insert_key_merged(ucl_object_t *top, ucl_object_t *elt, const char *key, size_t keylen, bool copy_key) argument
2317 ucl_object_replace_key(ucl_object_t *top, ucl_object_t *elt, const char *key, size_t keylen, bool copy_key) argument
2324 ucl_object_merge(ucl_object_t *top, ucl_object_t *elt, bool copy) argument
2421 const ucl_object_t *elt = NULL; local
2771 ucl_array_append(ucl_object_t *top, ucl_object_t *elt) argument
2798 ucl_array_prepend(ucl_object_t *top, ucl_object_t *elt) argument
2823 ucl_array_merge(ucl_object_t *top, ucl_object_t *elt, bool copy) argument
2859 ucl_array_delete(ucl_object_t *top, ucl_object_t *elt) argument
2951 ucl_array_index_of(ucl_object_t *top, ucl_object_t *elt) argument
2970 ucl_array_replace_index(ucl_object_t *top, ucl_object_t *elt, unsigned int index) argument
2985 ucl_elt_append(ucl_object_t *head, ucl_object_t *elt) argument
[all...]
/freebsd-11-stable/contrib/gcc/
H A Dtree-sra.c397 can_completely_scalarize_p (struct sra_elt *elt)
401 if (elt->cannot_scalarize)
404 for (c = elt->children; c; c = c->sibling)
408 for (c = elt->groups; c; c = c->sibling)
535 struct sra_elt *elt;
547 elt = *slot;
548 if (!elt && insert == INSERT)
550 *slot = elt = obstack_alloc (&sra_obstack, sizeof (*elt));
551 memset (elt,
396 can_completely_scalarize_p(struct sra_elt *elt) argument
533 struct sra_elt *elt; local
589 struct sra_elt *elt; local
731 struct sra_elt *elt = maybe_lookup_element_for_expr (expr); local
1035 scan_use(struct sra_elt *elt, tree *expr_p ATTRIBUTE_UNUSED, block_stmt_iterator *bsi ATTRIBUTE_UNUSED, bool is_output ATTRIBUTE_UNUSED, bool use_all ATTRIBUTE_UNUSED) argument
1058 scan_ldst(struct sra_elt *elt, tree other ATTRIBUTE_UNUSED, block_stmt_iterator *bsi ATTRIBUTE_UNUSED, bool is_output ATTRIBUTE_UNUSED) argument
1068 scan_dump(struct sra_elt *elt) argument
1103 struct sra_elt *elt = lookup_element (NULL, var, NULL, NO_INSERT); local
1118 build_element_name_1(struct sra_elt *elt) argument
1163 build_element_name(struct sra_elt *elt) argument
1173 instantiate_element(struct sra_elt *elt) argument
1228 decide_instantiation_1(struct sra_elt *elt, unsigned int parent_uses, unsigned int parent_copies) argument
1273 sum_instantiated_sizes(struct sra_elt *elt, unsigned HOST_WIDE_INT *sizep) argument
1298 instantiate_missing_elements_1(struct sra_elt *elt, tree child, tree type) argument
1311 instantiate_missing_elements(struct sra_elt *elt) argument
1377 decide_block_copy(struct sra_elt *elt) argument
1521 struct sra_elt *elt = lookup_element (NULL, var, NULL, NO_INSERT); local
1593 mark_no_warning(struct sra_elt *elt) argument
1612 generate_one_element_ref(struct sra_elt *elt, tree base) argument
1649 generate_element_ref(struct sra_elt *elt) argument
1671 generate_copy_inout(struct sra_elt *elt, bool copy_out, tree expr, tree *list_p) argument
1743 generate_element_zero(struct sra_elt *elt, tree *list_p) argument
1786 generate_element_init_1(struct sra_elt *elt, tree init, tree *list_p) argument
1866 generate_element_init(struct sra_elt *elt, tree init, tree *list_p) argument
1962 scalarize_use(struct sra_elt *elt, tree *expr_p, block_stmt_iterator *bsi, bool is_output, bool use_all) argument
2157 scalarize_ldst(struct sra_elt *elt, tree other, block_stmt_iterator *bsi, bool is_output) argument
2230 struct sra_elt *elt = lookup_element (NULL, var, NULL, NO_INSERT); local
2259 dump_sra_elt_name(FILE *f, struct sra_elt *elt) argument
2289 debug_sra_elt_name(struct sra_elt *elt) argument
[all...]
H A Dcse.c684 struct table_elt *elt;
690 for (elt = classp->first_same_value; elt; elt = elt->next_same_value)
692 print_rtl (stderr, elt->exp);
1314 remove_from_table (struct table_elt *elt, unsigned int hash)
1316 if (elt == 0)
1320 elt->first_same_value = 0;
1325 struct table_elt *prev = elt
682 struct table_elt *elt; local
1310 remove_from_table(struct table_elt *elt, unsigned int hash) argument
1390 struct table_elt *elt; local
1512 struct table_elt *elt; local
1690 struct table_elt *elt, *next, *new; local
2085 use_related_value(rtx x, struct table_elt *elt) argument
2283 rtx elt; local
2855 struct table_elt *elt; local
3282 struct table_elt *elt; local
3323 struct table_elt *elt; local
4497 struct table_elt *elt; local
5082 struct table_elt *elt = 0, *p; local
5976 struct table_elt *elt; local
6045 struct table_elt *elt; local
6082 struct table_elt *elt; local
6221 struct table_elt *elt = sets[i].src_elt; local
6238 struct table_elt *elt; local
6316 struct table_elt *elt, *classp = 0; local
7447 rtx elt = XVECEXP (PATTERN (insn), 0, i); local
[all...]
H A Dbitmap.c51 bitmap_elem_to_freelist (bitmap head, bitmap_element *elt)
55 elt->next = NULL;
58 elt->prev = bit_obstack->elements;
59 bit_obstack->elements = elt;
63 elt->prev = bitmap_ggc_free;
64 bitmap_ggc_free = elt;
72 bitmap_element_free (bitmap head, bitmap_element *elt)
74 bitmap_element *next = elt->next;
75 bitmap_element *prev = elt->prev;
83 if (head->first == elt)
50 bitmap_elem_to_freelist(bitmap head, bitmap_element *elt) argument
71 bitmap_element_free(bitmap head, bitmap_element *elt) argument
150 bitmap_elt_clear_from(bitmap head, bitmap_element *elt) argument
356 bitmap_elt_insert_after(bitmap head, bitmap_element *elt, unsigned int indx) argument
562 bitmap_element *elt; local
589 bitmap_element *elt = a->first; local
866 bitmap_element *elt = bitmap_find_bit (head, start); local
[all...]
H A Dtree-ssa-threadupdate.c250 struct redirection_data *elt; local
254 elt = XNEW (struct redirection_data);
255 elt->outgoing_edge = e;
256 elt->dup_block = NULL;
257 elt->do_not_duplicate = false;
258 elt->incoming_edges = NULL;
260 slot = htab_find_slot (redirection_data, elt, insert);
266 free (elt);
274 *slot = (void *)elt;
275 elt
[all...]
H A Dtree-nested.c270 struct var_map_elt *elt, dummy; local
281 elt = (struct var_map_elt *) *slot;
283 if (!elt && insert == INSERT)
307 elt = GGC_NEW (struct var_map_elt);
308 elt->old = decl;
309 elt->new = field;
310 *slot = elt;
316 field = elt ? elt->new : NULL;
471 struct var_map_elt *elt, dumm local
867 struct var_map_elt *elt, dummy; local
1200 struct var_map_elt *elt, dummy; local
1493 struct var_map_elt *elt, dummy; local
1561 struct var_map_elt *elt, dummy; local
[all...]
/freebsd-11-stable/usr.sbin/kldxref/
H A Dkldxref.c226 struct pnp_elt *elt; local
267 elt = malloc(sizeof(struct pnp_elt) + strlen(key) + 1);
268 TAILQ_INSERT_TAIL(list, elt, next);
269 elt->pe_key = (char *)(elt + 1);
270 elt->pe_offset = off;
272 elt->pe_kind = TYPE_U8;
274 elt->pe_kind = TYPE_V8;
276 elt->pe_kind = TYPE_G16;
278 elt
415 struct pnp_elt *elt, *elt_tmp; local
[all...]
/freebsd-11-stable/contrib/groff/src/preproc/grn/
H A Dgprint.h80 #define DBNextElt(elt) (elt->nextelt)
81 #define DBNextofSet(elt) (elt->setnext)
82 #define DBNullelt(elt) (elt == NULL)
/freebsd-11-stable/contrib/gdb/gdb/
H A Dexpprint.c759 int elt; local
771 for (elt = 0; elt < exp->nelts; elt++)
773 fprintf_filtered (stream, "\t%5d ", elt);
774 opcode_name = op_name (exp, exp->elts[elt].opcode);
777 print_longest (stream, 'd', 0, exp->elts[elt].longconst);
780 for (eltscan = (char *) &exp->elts[elt],
797 dump_subexp (struct expression *exp, struct ui_file *stream, int elt) argument
803 fprintf_filtered (stream, "\t%5d ", elt);
823 dump_subexp_body(struct expression *exp, struct ui_file *stream, int elt) argument
831 dump_subexp_body_standard(struct expression *exp, struct ui_file *stream, int elt) argument
1052 int elt; local
[all...]
/freebsd-11-stable/contrib/subversion/subversion/libsvn_subr/
H A Dskel.c163 svn_skel_t *elt;
165 for (elt = skel->children; elt; elt = elt->next)
166 if (! elt->is_atom)
182 svn_skel_t *elt;
184 for (elt = skel->children; elt; elt
160 svn_skel_t *elt; local
179 svn_skel_t *elt; local
700 svn_skel_t *elt; local
728 svn_skel_t *elt; local
758 svn_skel_t *elt; local
[all...]
/freebsd-11-stable/contrib/apr-util/misc/
H A Dapr_thread_pool.c210 struct apr_thread_list_elt *elt; local
213 elt = apr_pcalloc(me->pool, sizeof(*elt));
214 if (NULL == elt) {
219 elt = APR_RING_FIRST(me->recycled_thds);
220 APR_RING_REMOVE(elt, link);
223 APR_RING_ELEM_INIT(elt, link);
224 elt->thd = t;
225 elt->current_owner = NULL;
226 elt
243 struct apr_thread_list_elt *elt; local
664 struct apr_thread_list_elt *elt; local
783 struct apr_thread_list_elt *head, *tail, *elt; local
831 struct apr_thread_list_elt *elt, *head, *tail; local
[all...]
/freebsd-11-stable/contrib/libucl/tests/
H A Dtest_msgpack.c106 ucl_object_t *obj, *elt; local
145 elt = tests[sel]();
146 assert (elt != NULL);
149 ucl_object_insert_key (obj, elt, key, klen, true);
153 elt = ucl_test_large_array ();
154 ucl_object_insert_key (obj, elt, key, klen, true);
157 elt = ucl_test_large_map ();
158 ucl_object_insert_key (obj, elt, key, klen, true);
161 elt = ucl_test_large_string ();
162 ucl_object_insert_key (obj, elt, ke
252 ucl_object_t *res, *elt; local
[all...]
H A Dtest_schema.c134 const ucl_object_t *elt; local
154 while ((elt = ucl_object_iterate (obj, &iter, true)) != NULL) {
155 ret = perform_tests (elt);
/freebsd-11-stable/contrib/top/
H A Dgetans83 for elt in $path; do
84 if [ -f "$elt/$input" ]; then x=1; break; fi
/freebsd-11-stable/contrib/subversion/subversion/libsvn_ra_svn/
H A Dinternal_auth.c44 svn_ra_svn__item_t *elt; local
48 elt = &SVN_RA_SVN__LIST_ITEM(mechlist, i);
49 if (elt->kind == SVN_RA_SVN_WORD && strcmp(elt->u.word.data, mech) == 0)
/freebsd-11-stable/contrib/subversion/subversion/libsvn_client/
H A Diprops.c114 svn_prop_inherited_item_t *elt =
118 if (! (svn_path_is_url(elt->path_or_url)
119 || svn_dirent_is_absolute(elt->path_or_url)))
121 elt->path_or_url = svn_path_url_add_component2(repos_root_url,
122 elt->path_or_url,
112 svn_prop_inherited_item_t *elt = local

Completed in 189 milliseconds

1234