/freebsd-10-stable/lib/libc/include/isc/ |
H A D | list.h | 34 #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-10-stable/contrib/ntp/lib/isc/include/isc/ |
H A D | list.h | 36 #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 D | queue.h | 38 #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 D | util.h | 192 #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...] |
/freebsd-10-stable/contrib/libucl/src/ |
H A D | ucl_hash.c | 42 ucl_hash_node_t *elt, *tmp; local 45 HASH_ITER (hh, hashlin->buckets, elt, tmp) { 46 HASH_DELETE (hh, hashlin->buckets, elt); 48 DL_FOREACH_SAFE (elt->data, cur, otmp) { 53 UCL_FREE (sizeof (ucl_hash_node_t), elt); local 72 ucl_hash_node_t *elt = *iter; local 74 if (elt == NULL) { 78 elt = hashlin->buckets; 79 if (elt == NULL) { 83 else if (elt 94 ucl_hash_node_t *elt = iter; local [all...] |
H A D | ucl_schema.c | 141 const ucl_object_t *elt; local 145 while ((elt = ucl_iterate_object (obj, &iter, true)) != NULL) { 146 if (regexec (®, ucl_object_key (elt), 0, NULL, 0) == 0) { 147 res = elt; 165 const ucl_object_t *elt, *cur, *cur_dep; local 170 elt = ucl_object_find_key (obj, ucl_object_key (cur)); 171 if (elt != NULL) { 177 ucl_schema_create_error (err, UCL_SCHEMA_MISSING_DEPENDENCY, elt, 202 const ucl_object_t *elt, *prop, *found, *additional_schema = NULL, local 208 while (ret && (elt 342 const ucl_object_t *elt, *test; local 408 const ucl_object_t *elt; local 486 const ucl_object_t *elt; local 523 const ucl_object_t *elt, *it, *found, *additional_schema = NULL, local 640 const ucl_object_t *elt; local 696 const ucl_object_t *elt; local 834 const ucl_object_t *elt, *cur; local 882 const ucl_object_t *elt, *cur; local [all...] |
H A D | ucl_util.c | 1136 ucl_object_insert_key_common (ucl_object_t *top, ucl_object_t *elt, argument 1145 if (elt == NULL || key == NULL) { 1174 elt->flags |= UCL_OBJECT_NEED_KEY_ESCAPE; 1179 elt->key = key; 1180 elt->keylen = keylen; 1183 ucl_copy_key_trash (elt); 1186 found = __DECONST (ucl_object_t *, ucl_hash_search_obj (top->value.ov, elt)); 1189 top->value.ov = ucl_hash_insert_object (top->value.ov, elt); 1190 DL_APPEND (found, elt); 1200 top->value.ov = ucl_hash_insert_object (top->value.ov, elt); 1293 ucl_object_insert_key(ucl_object_t *top, ucl_object_t *elt, const char *key, size_t keylen, bool copy_key) argument 1300 ucl_object_insert_key_merged(ucl_object_t *top, ucl_object_t *elt, const char *key, size_t keylen, bool copy_key) argument 1307 ucl_object_replace_key(ucl_object_t *top, ucl_object_t *elt, const char *key, size_t keylen, bool copy_key) argument 1342 const ucl_object_t *elt; local 1529 ucl_array_append(ucl_object_t *top, ucl_object_t *elt) argument 1554 ucl_array_prepend(ucl_object_t *top, ucl_object_t *elt) argument 1580 ucl_array_delete(ucl_object_t *top, ucl_object_t *elt) argument 1664 ucl_elt_append(ucl_object_t *head, ucl_object_t *elt) argument [all...] |
/freebsd-10-stable/contrib/ntp/lib/isc/ |
H A D | symtab.c | 32 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 D | heap.c | 146 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-10-stable/contrib/gcc/ |
H A D | tree-sra.c | 397 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 D | cse.c | 684 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 D | bitmap.c | 51 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 D | tree-ssa-threadupdate.c | 250 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 D | tree-nested.c | 270 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...] |
H A D | cselib.h | 62 cselib_val *elt; local
|
/freebsd-10-stable/contrib/groff/src/preproc/grn/ |
H A D | gprint.h | 80 #define DBNextElt(elt) (elt->nextelt) 81 #define DBNextofSet(elt) (elt->setnext) 82 #define DBNullelt(elt) (elt == NULL)
|
/freebsd-10-stable/contrib/gdb/gdb/ |
H A D | expprint.c | 759 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-10-stable/contrib/subversion/subversion/libsvn_subr/ |
H A D | skel.c | 163 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-10-stable/contrib/apr-util/misc/ |
H A D | apr_thread_pool.c | 210 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-10-stable/contrib/texinfo/makeinfo/ |
H A D | xml.c | 666 xml_push_current_element (int elt) 668 element_stack[element_stack_index++] = elt; 672 xml_element_list[elt].name); 776 /* NOTE: We use `elt' rather than `element' in the argument list of 782 xml_insert_element_with_attribute (int elt, int arg, char *format, ...) 784 xml_insert_element_with_attribute (elt, arg, format, va_alist) 785 int elt; 801 (element_list->element_to_replace == elt) ) || 804 (element_list->element_to_replace == elt) ) ) 806 elt 664 xml_push_current_element(int elt) argument 780 xml_insert_element_with_attribute(int elt, int arg, char *format, ...) argument 988 xml_insert_element(int elt, int arg) argument 1348 xml_begin_docbook_float(int elt) argument 1641 int elt = xml_in_para ? INLINEIMAGE : MEDIAOBJECT; local [all...] |
/freebsd-10-stable/contrib/top/ |
H A D | getans | 83 for elt in $path; do 84 if [ -f "$elt/$input" ]; then x=1; break; fi
|
/freebsd-10-stable/contrib/subversion/subversion/libsvn_ra_svn/ |
H A D | internal_auth.c | 44 svn_ra_svn_item_t *elt; local 48 elt = &APR_ARRAY_IDX(mechlist, i, svn_ra_svn_item_t); 49 if (elt->kind == SVN_RA_SVN_WORD && strcmp(elt->u.word, mech) == 0)
|
/freebsd-10-stable/contrib/subversion/subversion/libsvn_client/ |
H A D | iprops.c | 114 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
|
/freebsd-10-stable/contrib/libucl/include/ |
H A D | ucl.h | 295 * Insert a object 'elt' to the hash 'top' and associate it with key 'key' 297 * @param elt element to insert (must NOT be NULL) 303 UCL_EXTERN bool ucl_object_insert_key (ucl_object_t *top, ucl_object_t *elt, 307 * Replace a object 'elt' to the hash 'top' and associate it with key 'key', old object will be unrefed, 310 * @param elt element to insert (must NOT be NULL) 316 UCL_EXTERN bool ucl_object_replace_key (ucl_object_t *top, ucl_object_t *elt, 359 * Insert a object 'elt' to the hash 'top' and associate it with key 'key', if the specified key exist, 362 * @param elt element to insert (must NOT be NULL) 368 UCL_EXTERN bool ucl_object_insert_key_merged (ucl_object_t *top, ucl_object_t *elt, 374 * @param elt elemen [all...] |
/freebsd-10-stable/contrib/libucl/tests/ |
H A D | test_schema.c | 128 const ucl_object_t *elt; local 148 while ((elt = ucl_iterate_object (obj, &iter, true)) != NULL) { 149 ret = perform_tests (elt);
|