Home
last modified time | relevance | path

Searched refs:elt (Results 1 – 25 of 111) sorted by relevance

12345

/NextBSD/contrib/ntp/lib/isc/include/isc/
HDlist.h36 #define ISC_LINK_INIT_TYPE(elt, link, type) \ argument
38 (elt)->link.prev = (type *)(-1); \
39 (elt)->link.next = (type *)(-1); \
41 #define ISC_LINK_INIT(elt, link) \ argument
42 ISC_LINK_INIT_TYPE(elt, link, void)
43 #define ISC_LINK_LINKED(elt, link) ((void *)((elt)->link.prev) != (void *)(-1)) argument
49 #define __ISC_LIST_PREPENDUNSAFE(list, elt, link) \ argument
52 (list).head->link.prev = (elt); \
54 (list).tail = (elt); \
55 (elt)->link.prev = NULL; \
[all …]
HDutil.h192 #define INIT_LINK(elt, link) ISC_LINK_INIT(elt, link) argument
196 #define PREV(elt, link) ISC_LIST_PREV(elt, link) argument
197 #define NEXT(elt, link) ISC_LIST_NEXT(elt, link) argument
198 #define APPEND(list, elt, link) ISC_LIST_APPEND(list, elt, link) argument
199 #define PREPEND(list, elt, link) ISC_LIST_PREPEND(list, elt, link) argument
200 #define UNLINK(list, elt, link) ISC_LIST_UNLINK(list, elt, link) argument
201 #define ENQUEUE(list, elt, link) ISC_LIST_APPEND(list, elt, link) argument
202 #define DEQUEUE(list, elt, link) ISC_LIST_UNLINK(list, elt, link) argument
HDqueue.h38 #define ISC_QLINK_INIT(elt, link) \ argument
40 (elt)->link.next = (void *)(-1); \
41 (elt)->link.linked = ISC_FALSE; \
43 #define ISC_QLINK_LINKED(elt, link) ((elt)->link.linked) argument
69 #define ISC_QUEUE_PUSH(queue, elt, link) \ argument
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; \
77 (elt)->link.linked = ISC_TRUE; \
/NextBSD/lib/libc/include/isc/
HDlist.h34 #define INIT_LINK_TYPE(elt, link, type) \ argument
36 (elt)->link.prev = (type *)(-1); \
37 (elt)->link.next = (type *)(-1); \
39 #define INIT_LINK(elt, link) \ argument
40 INIT_LINK_TYPE(elt, link, void)
41 #define LINKED(elt, link) ((void *)((elt)->link.prev) != (void *)(-1) && \ argument
42 (void *)((elt)->link.next) != (void *)(-1))
48 #define PREPEND(list, elt, link) \ argument
50 INSIST(!LINKED(elt, link));\
52 (list).head->link.prev = (elt); \
[all …]
/NextBSD/sys/sys/mach/
HDqueue.h137 #define enqueue(queue,elt) enqueue_tail(queue, elt) argument
145 queue_entry_t elt);
150 queue_entry_t elt);
163 queue_entry_t elt);
172 queue_entry_t elt);
179 queue_entry_t elt) in enqueue_head() argument
181 elt->next = que->next; in enqueue_head()
182 elt->prev = que; in enqueue_head()
183 elt->next->prev = elt; in enqueue_head()
184 que->next = elt; in enqueue_head()
[all …]
/NextBSD/contrib/libucl/src/
HDucl_schema.c141 const ucl_object_t *elt; in ucl_schema_test_pattern() local
145 while ((elt = ucl_iterate_object (obj, &iter, true)) != NULL) { in ucl_schema_test_pattern()
146 if (regexec (&reg, ucl_object_key (elt), 0, NULL, 0) == 0) { in ucl_schema_test_pattern()
147 res = elt; in ucl_schema_test_pattern()
165 const ucl_object_t *elt, *cur, *cur_dep; in ucl_schema_validate_dependencies() local
170 elt = ucl_object_find_key (obj, ucl_object_key (cur)); in ucl_schema_validate_dependencies()
171 if (elt != NULL) { in ucl_schema_validate_dependencies()
177 ucl_schema_create_error (err, UCL_SCHEMA_MISSING_DEPENDENCY, elt, in ucl_schema_validate_dependencies()
202 const ucl_object_t *elt, *prop, *found, *additional_schema = NULL, in ucl_schema_validate_object() local
208 while (ret && (elt = ucl_iterate_object (schema, &iter, true)) != NULL) { in ucl_schema_validate_object()
[all …]
HDucl_hash.c297 struct ucl_hash_elt *elt; in ucl_hash_insert() local
308 elt = &kh_value (h, k); in ucl_hash_insert()
310 elt->obj = obj; in ucl_hash_insert()
311 elt->ar_idx = kv_size (hashlin->ar) - 1; in ucl_hash_insert()
319 elt = &kh_value (h, k); in ucl_hash_insert()
321 elt->obj = obj; in ucl_hash_insert()
322 elt->ar_idx = kv_size (hashlin->ar) - 1; in ucl_hash_insert()
332 struct ucl_hash_elt elt, *pelt; in ucl_hash_replace() local
343 elt = kh_value (h, k); in ucl_hash_replace()
348 pelt->ar_idx = elt.ar_idx; in ucl_hash_replace()
[all …]
HDucl_util.c2012 ucl_object_insert_key_common (ucl_object_t *top, ucl_object_t *elt, argument
2021 if (elt == NULL || key == NULL) {
2050 elt->flags |= UCL_OBJECT_NEED_KEY_ESCAPE;
2056 if (elt->trash_stack[UCL_TRASH_KEY] != NULL &&
2057 key != (const char *)elt->trash_stack[UCL_TRASH_KEY]) {
2059 free (elt->trash_stack[UCL_TRASH_KEY]);
2060 elt->trash_stack[UCL_TRASH_KEY] = NULL;
2061 elt->flags &= ~UCL_OBJECT_ALLOCATED_KEY;
2064 elt->key = key;
2065 elt->keylen = keylen;
[all …]
/NextBSD/contrib/gcc/
HDtree-sra.c396 can_completely_scalarize_p (struct sra_elt *elt) in can_completely_scalarize_p() argument
400 if (elt->cannot_scalarize) in can_completely_scalarize_p()
403 for (c = elt->children; c; c = c->sibling) in can_completely_scalarize_p()
407 for (c = elt->groups; c; c = c->sibling) in can_completely_scalarize_p()
533 struct sra_elt *elt; in lookup_element() local
545 elt = *slot; in lookup_element()
546 if (!elt && insert == INSERT) in lookup_element()
548 *slot = elt = obstack_alloc (&sra_obstack, sizeof (*elt)); in lookup_element()
549 memset (elt, 0, sizeof (*elt)); in lookup_element()
551 elt->parent = parent; in lookup_element()
[all …]
HDcse.c682 struct table_elt *elt; in dump_class() local
688 for (elt = classp->first_same_value; elt; elt = elt->next_same_value) in dump_class()
690 print_rtl (stderr, elt->exp); in dump_class()
1310 remove_from_table (struct table_elt *elt, unsigned int hash) in remove_from_table() argument
1312 if (elt == 0) in remove_from_table()
1316 elt->first_same_value = 0; in remove_from_table()
1321 struct table_elt *prev = elt->prev_same_value; in remove_from_table()
1322 struct table_elt *next = elt->next_same_value; in remove_from_table()
1343 struct table_elt *prev = elt->prev_same_hash; in remove_from_table()
1344 struct table_elt *next = elt->next_same_hash; in remove_from_table()
[all …]
HDbitmap.c50 bitmap_elem_to_freelist (bitmap head, bitmap_element *elt) in bitmap_elem_to_freelist() argument
54 elt->next = NULL; in bitmap_elem_to_freelist()
57 elt->prev = bit_obstack->elements; in bitmap_elem_to_freelist()
58 bit_obstack->elements = elt; in bitmap_elem_to_freelist()
62 elt->prev = bitmap_ggc_free; in bitmap_elem_to_freelist()
63 bitmap_ggc_free = elt; in bitmap_elem_to_freelist()
71 bitmap_element_free (bitmap head, bitmap_element *elt) in bitmap_element_free() argument
73 bitmap_element *next = elt->next; in bitmap_element_free()
74 bitmap_element *prev = elt->prev; in bitmap_element_free()
82 if (head->first == elt) in bitmap_element_free()
[all …]
HDtree-ssa-threadupdate.c250 struct redirection_data *elt; in lookup_redirection_data() local
254 elt = XNEW (struct redirection_data); in lookup_redirection_data()
255 elt->outgoing_edge = e; in lookup_redirection_data()
256 elt->dup_block = NULL; in lookup_redirection_data()
257 elt->do_not_duplicate = false; in lookup_redirection_data()
258 elt->incoming_edges = NULL; in lookup_redirection_data()
260 slot = htab_find_slot (redirection_data, elt, insert); in lookup_redirection_data()
266 free (elt); in lookup_redirection_data()
274 *slot = (void *)elt; in lookup_redirection_data()
275 elt->incoming_edges = XNEW (struct el); in lookup_redirection_data()
[all …]
HDtree-nested.c270 struct var_map_elt *elt, dummy; in lookup_field_for_decl() local
281 elt = (struct var_map_elt *) *slot; in lookup_field_for_decl()
283 if (!elt && insert == INSERT) in lookup_field_for_decl()
307 elt = GGC_NEW (struct var_map_elt); in lookup_field_for_decl()
308 elt->old = decl; in lookup_field_for_decl()
309 elt->new = field; in lookup_field_for_decl()
310 *slot = elt; in lookup_field_for_decl()
316 field = elt ? elt->new : NULL; in lookup_field_for_decl()
471 struct var_map_elt *elt, dummy; in lookup_tramp_for_decl() local
482 elt = (struct var_map_elt *) *slot; in lookup_tramp_for_decl()
[all …]
/NextBSD/contrib/ntp/lib/isc/
HDsymtab.c32 typedef struct elt { struct
36 LINK(struct elt) link; argument
100 elt_t *elt, *nelt; in isc_symtab_destroy() local
107 for (elt = HEAD(symtab->table[i]); elt != NULL; elt = nelt) { in isc_symtab_destroy()
108 nelt = NEXT(elt, link); in isc_symtab_destroy()
110 (symtab->undefine_action)(elt->key, in isc_symtab_destroy()
111 elt->type, in isc_symtab_destroy()
112 elt->value, in isc_symtab_destroy()
114 isc_mem_put(symtab->mctx, elt, sizeof(*elt)); in isc_symtab_destroy()
172 elt_t *elt; in isc_symtab_lookup() local
[all …]
HDheap.c146 float_up(isc_heap_t *heap, unsigned int i, void *elt) { in float_up() argument
150 i > 1 && heap->compare(elt, heap->array[p]) ; in float_up()
156 heap->array[i] = elt; in float_up()
164 sink_down(isc_heap_t *heap, unsigned int i, void *elt) { in sink_down() argument
174 if (heap->compare(elt, heap->array[j])) in sink_down()
181 heap->array[i] = elt; in sink_down()
189 isc_heap_insert(isc_heap_t *heap, void *elt) { in isc_heap_insert() argument
200 float_up(heap, new_last, elt); in isc_heap_insert()
207 void *elt; in isc_heap_delete() local
217 elt = heap->array[heap->last]; in isc_heap_delete()
[all …]
/NextBSD/usr.sbin/kldxref/
HDkldxref.c226 struct pnp_elt *elt; in parse_pnp_list() local
267 elt = malloc(sizeof(struct pnp_elt) + strlen(key) + 1); in parse_pnp_list()
268 TAILQ_INSERT_TAIL(list, elt, next); in parse_pnp_list()
269 elt->pe_key = (char *)(elt + 1); in parse_pnp_list()
270 elt->pe_offset = off; in parse_pnp_list()
272 elt->pe_kind = TYPE_U8; in parse_pnp_list()
274 elt->pe_kind = TYPE_V8; in parse_pnp_list()
276 elt->pe_kind = TYPE_G16; in parse_pnp_list()
278 elt->pe_kind = TYPE_L16; in parse_pnp_list()
280 elt->pe_kind = TYPE_M16; in parse_pnp_list()
[all …]
/NextBSD/contrib/gdb/gdb/
HDexpprint.c759 int elt; in dump_raw_expression() local
771 for (elt = 0; elt < exp->nelts; elt++) in dump_raw_expression()
773 fprintf_filtered (stream, "\t%5d ", elt); in dump_raw_expression()
774 opcode_name = op_name (exp, exp->elts[elt].opcode); in dump_raw_expression()
777 print_longest (stream, 'd', 0, exp->elts[elt].longconst); in dump_raw_expression()
780 for (eltscan = (char *) &exp->elts[elt], in dump_raw_expression()
797 dump_subexp (struct expression *exp, struct ui_file *stream, int elt) in dump_subexp() argument
803 fprintf_filtered (stream, "\t%5d ", elt); in dump_subexp()
809 fprintf_filtered (stream, "%-20s ", op_name (exp, exp->elts[elt].opcode)); in dump_subexp()
811 elt = dump_subexp_body (exp, stream, elt); in dump_subexp()
[all …]
/NextBSD/contrib/subversion/subversion/libsvn_subr/
HDskel.c160 svn_skel_t *elt; in is_valid_proplist_skel() local
162 for (elt = skel->children; elt; elt = elt->next) in is_valid_proplist_skel()
163 if (! elt->is_atom) in is_valid_proplist_skel()
179 svn_skel_t *elt; in is_valid_iproplist_skel() local
181 for (elt = skel->children; elt; elt = elt->next) in is_valid_iproplist_skel()
183 if (!elt->is_atom) in is_valid_iproplist_skel()
186 if (elt->next == NULL) in is_valid_iproplist_skel()
189 elt = elt->next; in is_valid_iproplist_skel()
191 if (! is_valid_proplist_skel(elt)) in is_valid_iproplist_skel()
700 svn_skel_t *elt; in svn_skel__parse_proplist() local
[all …]
/NextBSD/contrib/apr-util/misc/
HDapr_thread_pool.c210 struct apr_thread_list_elt *elt; in elt_new() local
213 elt = apr_pcalloc(me->pool, sizeof(*elt)); in elt_new()
214 if (NULL == elt) { in elt_new()
219 elt = APR_RING_FIRST(me->recycled_thds); in elt_new()
220 APR_RING_REMOVE(elt, link); in elt_new()
223 APR_RING_ELEM_INIT(elt, link); in elt_new()
224 elt->thd = t; in elt_new()
225 elt->current_owner = NULL; in elt_new()
226 elt->state = TH_RUN; in elt_new()
227 return elt; in elt_new()
[all …]
/NextBSD/contrib/gcc/config/arm/
HDpredicates.md279 rtx elt;
286 if (GET_CODE (SET_SRC (elt = XVECEXP (op, 0, 0))) == PLUS)
292 if (GET_CODE (SET_DEST (elt)) != REG
293 || GET_CODE (XEXP (SET_SRC (elt), 0)) != REG
294 || GET_CODE (XEXP (SET_SRC (elt), 1)) != CONST_INT
295 || INTVAL (XEXP (SET_SRC (elt), 1)) != (count - 1) * 4)
311 elt = XVECEXP (op, 0, i);
313 if (GET_CODE (elt) != SET
314 || GET_CODE (SET_DEST (elt)) != REG
315 || GET_MODE (SET_DEST (elt)) != SImode
[all …]
/NextBSD/contrib/gcc/config/rs6000/
HDpredicates.md841 rtx elt = XVECEXP (op, 0, i);
843 if (GET_CODE (elt) != SET
844 || GET_CODE (SET_DEST (elt)) != REG
845 || GET_MODE (SET_DEST (elt)) != SImode
846 || REGNO (SET_DEST (elt)) != dest_regno + i
847 || GET_CODE (SET_SRC (elt)) != MEM
848 || GET_MODE (SET_SRC (elt)) != SImode
849 || GET_CODE (XEXP (SET_SRC (elt), 0)) != PLUS
850 || ! rtx_equal_p (XEXP (XEXP (SET_SRC (elt), 0), 0), src_addr)
851 || GET_CODE (XEXP (XEXP (SET_SRC (elt), 0), 1)) != CONST_INT
[all …]
/NextBSD/contrib/groff/src/preproc/grn/
HDgprint.h80 #define DBNextElt(elt) (elt->nextelt) argument
81 #define DBNextofSet(elt) (elt->setnext) argument
82 #define DBNullelt(elt) (elt == NULL) argument
/NextBSD/contrib/gcc/config/s390/
HDpredicates.md305 rtx elt = XVECEXP (op, 0, i);
307 if (GET_CODE (elt) != SET
308 || GET_CODE (SET_DEST (elt)) != REG
309 || GET_MODE (SET_DEST (elt)) != elt_mode
310 || REGNO (SET_DEST (elt)) != dest_regno + i
311 || GET_CODE (SET_SRC (elt)) != MEM
312 || GET_MODE (SET_SRC (elt)) != elt_mode
313 || GET_CODE (XEXP (SET_SRC (elt), 0)) != PLUS
314 || ! rtx_equal_p (XEXP (XEXP (SET_SRC (elt), 0), 0), src_addr)
315 || GET_CODE (XEXP (XEXP (SET_SRC (elt), 0), 1)) != CONST_INT
[all …]
/NextBSD/contrib/libucl/tests/
HDtest_msgpack.c101 ucl_object_t *obj, *elt; in main() local
140 elt = tests[sel](); in main()
141 assert (elt != NULL); in main()
144 ucl_object_insert_key (obj, elt, key, klen, true); in main()
215 ucl_object_t *res, *elt; in ucl_test_string() local
239 elt = ucl_object_fromstring_common (str, cur_len % 128, in ucl_test_string()
241 elt->flags |= UCL_OBJECT_BINARY; in ucl_test_string()
242 ucl_array_append (res, elt); in ucl_test_string()
247 elt = ucl_object_fromstring_common (str, cur_len % 512, in ucl_test_string()
249 elt->flags |= UCL_OBJECT_BINARY; in ucl_test_string()
[all …]
/NextBSD/contrib/libucl/include/
HDucl.h364 UCL_EXTERN bool ucl_object_insert_key (ucl_object_t *top, ucl_object_t *elt,
377 UCL_EXTERN bool ucl_object_replace_key (ucl_object_t *top, ucl_object_t *elt,
387 UCL_EXTERN bool ucl_object_merge (ucl_object_t *top, ucl_object_t *elt, bool copy);
440 UCL_EXTERN bool ucl_object_insert_key_merged (ucl_object_t *top, ucl_object_t *elt,
450 ucl_object_t *elt);
459 ucl_object_t *elt);
468 UCL_EXTERN bool ucl_array_merge (ucl_object_t *top, ucl_object_t *elt,
480 ucl_object_t *elt);
530 ucl_object_t *elt);
542 ucl_array_replace_index (ucl_object_t *top, ucl_object_t *elt,
[all …]

12345