/dragonfly/lib/libc/include/isc/ |
H A D | list.h | 38 #define LINKED(elt, link) ((void *)((elt)->link.prev) != (void *)(-1)) argument 53 (list).head = (elt); \ 65 (list).tail = (elt); \ 72 (elt)->link.next->link.prev = (elt)->link.prev; \ 78 (elt)->link.prev->link.next = (elt)->link.next; \ 88 #define PREV(elt, link) ((elt)->link.prev) argument 89 #define NEXT(elt, link) ((elt)->link.next) argument 99 (elt)->link.prev->link.next = (elt); \ 112 (elt)->link.next->link.prev = (elt); \ 117 #define ENQUEUE(list, elt, link) APPEND(list, elt, link) argument [all …]
|
/dragonfly/contrib/gdb-7/gdb/ |
H A D | expprint.c | 704 for (elt = 0; elt < exp->nelts; elt++) in dump_raw_expression() 773 elt = dump_subexp (exp, stream, elt); in dump_subexp_body_standard() 810 elt = dump_subexp (exp, stream, elt); in dump_subexp_body_standard() 833 elt = dump_subexp (exp, stream, elt); in dump_subexp_body_standard() 896 elt = dump_subexp (exp, stream, elt); in dump_subexp_body_standard() 911 elt = dump_subexp (exp, stream, elt); in dump_subexp_body_standard() 919 elt = dump_subexp (exp, stream, elt); in dump_subexp_body_standard() 921 elt = dump_subexp (exp, stream, elt); in dump_subexp_body_standard() 1006 elt = dump_subexp (exp, stream, elt); in dump_subexp_body_standard() 1039 for (elt = 0; elt < exp->nelts;) in dump_prefix_expression() [all …]
|
/dragonfly/contrib/gcc-4.7/gcc/ |
H A D | bitmap.c | 142 elt->next = NULL; in bitmap_elem_to_freelist() 484 if (!elt) in bitmap_elt_insert_after() 719 for (elt = a->first; elt; elt = elt->next) in bitmap_count_bits() 835 elt = elt->next; in bitmap_last_set_bit() 1202 if (!elt) in bitmap_set_range() 1222 if (!elt || elt->indx != i) in bitmap_set_range() 1275 elt = elt->next; in bitmap_set_range() 1278 head->current = elt ? elt : elt_prev; in bitmap_set_range() 1300 if (!elt) in bitmap_clear_range() 1317 while (elt && (elt->indx <= last_index)) in bitmap_clear_range() [all …]
|
H A D | cse.c | 664 for (elt = classp->first_same_value; elt; elt = elt->next_same_value) in dump_class() 1453 if (elt->related_value != 0 && elt->related_value != elt) in remove_from_table() 1628 elt->first_same_value = elt; in insert_with_costs() 1655 elt->first_same_value = elt; in insert_with_costs() 1775 for (elt = class2; elt; elt = next) in merge_equiv_classes() 3811 for (elt = elt->first_same_value; elt; elt = elt->next_same_value) in equiv_constant() 4765 elt = elt->first_same_value; in cse_insn() 4879 while (elt && !REG_P (elt->exp) in cse_insn() 4881 elt = elt->next_same_value; in cse_insn() 4896 elt = elt->next_same_value; in cse_insn() [all …]
|
H A D | tree-affine.c | 68 comb->elts[0].val = elt; in aff_combination_elt() 177 elt = fold_convert (type, elt); in aff_combination_add_elt() 180 fold_convert (type, elt), in aff_combination_add_elt() 185 elt); in aff_combination_add_elt() 187 comb->rest = elt; in aff_combination_add_elt() 382 elt = fold_convert (type1, elt); in add_elt_to_tree() 401 elt = fold_build1 (NEGATE_EXPR, type1, elt); in add_elt_to_tree() 420 elt = fold_build2 (MULT_EXPR, type1, elt, in add_elt_to_tree() 425 elt = fold_build1 (NEGATE_EXPR, type1, elt); in add_elt_to_tree() 800 struct aff_comb_elt *elt in aff_combination_constant_multiple_p() local [all …]
|
H A D | tree-switch-conversion.c | 444 constructor_elt *elt; in build_constructors() local 446 elt = VEC_quick_push (constructor_elt, in build_constructors() 450 elt->value = info.default_values[k]; in build_constructors() 472 constructor_elt *elt; in build_constructors() local 477 elt->value = val; in build_constructors() 496 constructor_elt *elt; in constructor_contains_same_values_p() local 501 prev = elt->value; in constructor_contains_same_values_p() 516 constructor_elt *elt; in array_value_type() local 538 cst = TREE_INT_CST (elt->value); in array_value_type() 618 constructor_elt *elt; in build_one_array() local [all …]
|
H A D | tree-ssa-threadupdate.c | 253 struct redirection_data *elt; in lookup_redirection_data() local 261 elt->dup_block = NULL; in lookup_redirection_data() 262 elt->incoming_edges = NULL; in lookup_redirection_data() 270 free (elt); in lookup_redirection_data() 278 *slot = (void *)elt; in lookup_redirection_data() 280 elt->incoming_edges->e = e; in lookup_redirection_data() 282 return elt; in lookup_redirection_data() 289 free (elt); in lookup_redirection_data() 299 el->next = elt->incoming_edges; in lookup_redirection_data() 301 elt->incoming_edges = el; in lookup_redirection_data() [all …]
|
H A D | cselib.c | 50 cselib_val *elt; member 223 el->elt = elt; in new_elt_list() 1123 rtx elt; in cselib_hash_rtx() local 1363 return l->elt; in cselib_lookup_mem() 1559 if (l && l->elt == NULL) in cselib_expand_value_rtx_1() 1836 return l->elt->val_rtx; in cselib_subst_to_values() 1970 return l->elt; in cselib_lookup_1() 2003 if (l && l->elt == NULL) in cselib_lookup_1() 2179 (*l)->elt = NULL; in cselib_invalidate_regno() 2385 gcc_checking_assert (elt); in cselib_add_permanent_equiv() [all …]
|
/dragonfly/contrib/gcc-8.0/libstdc++-v3/src/c++11/ |
H A D | condition_variable.cc | 90 auto elt = (__at_thread_exit_elt*)p; in run() local 91 while (elt) in run() 93 auto next = elt->_M_next; in run() 94 elt->_M_cb(elt); in run() 95 elt = next; in run() 101 auto elt = (__at_thread_exit_elt*)__gthread_getspecific(key); in run() local 103 run(elt); in run() 140 __at_thread_exit(__at_thread_exit_elt* elt) in __at_thread_exit() argument 145 elt->_M_next = (__at_thread_exit_elt*)__gthread_getspecific(key); in __at_thread_exit() 146 __gthread_setspecific(key, elt); in __at_thread_exit()
|
/dragonfly/contrib/gcc-8.0/gcc/ |
H A D | bitmap.c | 69 elt->indx = -1; in bitmap_elem_to_freelist() 412 if (!elt) in bitmap_elt_insert_after() 695 for (elt = a->first; elt; elt = elt->next) in bitmap_count_bits() 837 elt = elt->next; in bitmap_last_set_bit() 1212 if (!elt) in bitmap_set_range() 1232 if (!elt || elt->indx != i) in bitmap_set_range() 1285 elt = elt->next; in bitmap_set_range() 1288 head->current = elt ? elt : elt_prev; in bitmap_set_range() 1316 if (!elt) in bitmap_clear_range() 1333 while (elt && (elt->indx <= last_index)) in bitmap_clear_range() [all …]
|
H A D | cse.c | 643 for (elt = classp->first_same_value; elt; elt = elt->next_same_value) in dump_class() 1422 if (elt->related_value != 0 && elt->related_value != elt) in remove_from_table() 1597 elt->first_same_value = elt; in insert_with_costs() 1624 elt->first_same_value = elt; in insert_with_costs() 1744 for (elt = class2; elt; elt = next) in merge_equiv_classes() 3851 for (elt = elt->first_same_value; elt; elt = elt->next_same_value) in equiv_constant() 5029 elt = elt->first_same_value; in cse_insn() 5143 while (elt && !REG_P (elt->exp) in cse_insn() 5145 elt = elt->next_same_value; in cse_insn() 5160 elt = elt->next_same_value; in cse_insn() [all …]
|
H A D | rtx-vector-builder.c | 73 RTVEC_ELT (v, i) = elt (i); in build() 89 rtx elt = (*this)[0]; in find_cached_value() local 93 if (elt == const1_rtx || elt == constm1_rtx) in find_cached_value() 95 else if (elt == const0_rtx) in find_cached_value() 104 if (elt == CONST0_RTX (inner_mode)) in find_cached_value() 106 else if (elt == CONST1_RTX (inner_mode)) in find_cached_value() 108 else if (elt == CONSTM1_RTX (inner_mode)) in find_cached_value()
|
H A D | tree-affine.c | 82 comb->elts[0].val = elt; in aff_combination_elt() 175 comb->elts[comb->n].val = elt; in aff_combination_add_elt() 185 elt = fold_convert (type, elt); in aff_combination_add_elt() 188 fold_convert (type, elt), in aff_combination_add_elt() 193 elt); in aff_combination_add_elt() 195 comb->rest = elt; in aff_combination_add_elt() 454 elt = fold_convert (type, elt); in add_elt_to_tree() 458 return elt; in add_elt_to_tree() 482 elt = fold_build2 (MULT_EXPR, type, elt, wide_int_to_tree (type, scale)); in add_elt_to_tree() 868 struct aff_comb_elt *elt in aff_combination_constant_multiple_p() local [all …]
|
H A D | stmt.c | 886 tree elt; in expand_case() local 913 elt = gimple_switch_label (stmt, 1); in expand_case() 916 if (CASE_HIGH (elt)) in expand_case() 931 tree low = CASE_LOW (elt); in expand_case() 933 tree high = CASE_HIGH (elt); in expand_case() 935 tree lab = CASE_LABEL (elt); in expand_case() 1050 tree elt = dispatch_table[i]; in expand_sjlj_dispatch_table() local 1071 tree elt = dispatch_table[i]; in expand_sjlj_dispatch_table() local 1072 tree high = CASE_HIGH (elt); in expand_sjlj_dispatch_table() 1074 high = CASE_LOW (elt); in expand_sjlj_dispatch_table() [all …]
|
H A D | tree-vector-builder.h | 101 tree_vector_builder::integral_p (const_tree elt) const in integral_p() argument 103 return TREE_CODE (elt) == INTEGER_CST; in integral_p() 120 tree_vector_builder::can_elide_p (const_tree elt) const in can_elide_p() argument 122 return !CONSTANT_CLASS_P (elt) || !TREE_OVERFLOW (elt); in can_elide_p()
|
H A D | cselib.c | 40 cselib_val *elt; member 275 el->elt = elt; in new_elt_list() 1165 rtx elt; in cselib_hash_rtx() local 1413 return l->elt; in cselib_lookup_mem() 1609 if (l && l->elt == NULL) in cselib_expand_value_rtx_1() 1886 return l->elt->val_rtx; in cselib_subst_to_values() 2018 return l->elt; in cselib_lookup_1() 2054 if (l && l->elt == NULL) in cselib_lookup_1() 2229 (*l)->elt = NULL; in cselib_invalidate_regno() 2434 gcc_checking_assert (elt); in cselib_add_permanent_equiv() [all …]
|
H A D | tree-ssa-loop-ivcanon.c | 499 struct nb_iter_bound *elt; in remove_exits_and_undefined_stmts() local 502 for (elt = loop->bounds; elt; elt = elt->next) in remove_exits_and_undefined_stmts() 507 if (!elt->is_exit in remove_exits_and_undefined_stmts() 508 && wi::ltu_p (elt->bound, npeeled)) in remove_exits_and_undefined_stmts() 524 else if (elt->is_exit in remove_exits_and_undefined_stmts() 525 && wi::leu_p (elt->bound, npeeled)) in remove_exits_and_undefined_stmts() 527 basic_block bb = gimple_bb (elt->stmt); in remove_exits_and_undefined_stmts() 557 struct nb_iter_bound *elt; in remove_redundant_iv_tests() local 562 for (elt = loop->bounds; elt; elt = elt->next) in remove_redundant_iv_tests() 566 if (elt->is_exit && loop->any_upper_bound in remove_redundant_iv_tests() [all …]
|
H A D | tree-switch-conversion.c | 667 last = CASE_HIGH (elt) ? CASE_HIGH (elt) : CASE_LOW (elt); in collect_switch_conv_info() 726 if (CASE_HIGH (elt) in collect_switch_conv_info() 727 && ! tree_int_cst_equal (CASE_LOW (elt), CASE_HIGH (elt))) in collect_switch_conv_info() 972 elt.value in build_constructors() 1021 constructor_elt *elt; in constructor_contains_same_values_p() local 1026 prev = elt->value; in constructor_contains_same_values_p() 1042 constructor_elt *elt; in array_value_type() local 1147 constructor_elt *elt; in build_one_array() local 1150 elt->value = fold_convert (value_type, elt->value); in build_one_array() 2051 tree elt; in try_switch_expansion() local [all …]
|
H A D | vec-perm-indices.h | 119 vec_perm_indices::clamp (element_type elt) const in clamp() argument 123 if (!can_div_trunc_p (elt, limit, &input, &elem_within_input)) in clamp() 124 return elt; in clamp() 140 return clamp (m_encoding.elt (i));
|
H A D | tree-emutls.c | 159 constructor_elt elt; in default_emutls_var_init() local 163 elt.index = field; in default_emutls_var_init() 165 v->quick_push (elt); in default_emutls_var_init() 168 elt.index = field; in default_emutls_var_init() 171 v->quick_push (elt); in default_emutls_var_init() 174 elt.index = field; in default_emutls_var_init() 175 elt.value = null_pointer_node; in default_emutls_var_init() 176 v->quick_push (elt); in default_emutls_var_init() 179 elt.index = field; in default_emutls_var_init() 180 elt.value = proxy; in default_emutls_var_init() [all …]
|
/dragonfly/contrib/gcc-8.0/libstdc++-v3/libsupc++/ |
H A D | atexit_thread.cc | 53 struct elt struct 57 elt *next; argument 66 elt *single_thread; 71 elt *e = static_cast<elt*>(p); in run() 74 elt *old_e = e; in run() 140 elt *first; in __cxa_thread_atexit() 142 first = static_cast<elt*>(__gthread_getspecific (key)); in __cxa_thread_atexit() 146 elt *new_elt = new (std::nothrow) elt; in __cxa_thread_atexit()
|
/dragonfly/contrib/binutils-2.34/binutils/ |
H A D | binemul.c | 67 bfd *elt; in do_ar_emul_append() local 70 for (elt = bfd_openr_next_archived_file (new_bfd, NULL); in do_ar_emul_append() 71 elt; in do_ar_emul_append() 72 elt = bfd_openr_next_archived_file (new_bfd, elt)) in do_ar_emul_append() 74 if (do_ar_emul_append (after_bfd, elt, verbose, TRUE, check)) in do_ar_emul_append()
|
/dragonfly/contrib/binutils-2.27/binutils/ |
H A D | binemul.c | 67 bfd *elt; in do_ar_emul_append() local 70 for (elt = bfd_openr_next_archived_file (new_bfd, NULL); in do_ar_emul_append() 71 elt; in do_ar_emul_append() 72 elt = bfd_openr_next_archived_file (new_bfd, elt)) in do_ar_emul_append() 74 if (do_ar_emul_append (after_bfd, elt, verbose, TRUE, check)) in do_ar_emul_append()
|
/dragonfly/contrib/zstd/lib/dictBuilder/ |
H A D | zdict.c | 413 const U32 eltEnd = elt.pos + elt.length; in ZDICT_tryMerge() 423 table[u].pos = elt.pos; in ZDICT_tryMerge() 424 table[u].savings += elt.savings * addedLength / elt.length; /* rough approx */ in ZDICT_tryMerge() 426 elt = table[u]; in ZDICT_tryMerge() 430 table[u] = elt; in ZDICT_tryMerge() 444 table[u].savings += elt.savings * addedLength / elt.length; /* rough approx */ in ZDICT_tryMerge() 447 elt = table[u]; in ZDICT_tryMerge() 450 table[u] = elt; in ZDICT_tryMerge() 457 table[u].pos = elt.pos; in ZDICT_tryMerge() 458 table[u].savings += (U32)(elt.savings * addedLength / elt.length); in ZDICT_tryMerge() [all …]
|
/dragonfly/contrib/gdb-7/gdb/python/ |
H A D | py-cmd.c | 258 PyObject *elt = PySequence_GetItem (resultobj, i); in VEC() local 261 if (elt == NULL || ! gdbpy_is_string (elt)) in VEC() 267 item = python_string_to_host_string (elt); in VEC() 319 struct cmd_list_element *elt; in gdbpy_parse_command_name() local 359 elt = lookup_cmd_1 (&prefix_text2, *start_list, NULL, 1); in gdbpy_parse_command_name() 360 if (!elt || elt == (struct cmd_list_element *) -1) in gdbpy_parse_command_name() 369 if (elt->prefixlist) in gdbpy_parse_command_name() 372 *base_list = elt->prefixlist; in gdbpy_parse_command_name()
|