/dragonfly/contrib/gcc-4.7/gcc/ |
H A D | stmt.c | 1951 if (!high || tree_int_cst_equal (low, high)) in add_case_node() 2296 if (! tree_int_cst_equal (n->low, n->high)) in expand_case() 2606 if (!tree_int_cst_equal (np->low, np->high)) in balance_case_nodes() 2634 if (!tree_int_cst_equal ((*npp)->low, (*npp)->high)) in balance_case_nodes() 2666 if (!tree_int_cst_equal ((*npp)->low, (*npp)->high)) in balance_case_nodes() 2714 if (tree_int_cst_equal (node->low, TYPE_MIN_VALUE (index_type))) in node_has_low_bound() 2735 if (tree_int_cst_equal (low_minus_one, pnode->high)) in node_has_low_bound() 2786 if (tree_int_cst_equal (high_plus_one, pnode->low)) in node_has_high_bound() 2847 else if (tree_int_cst_equal (node->low, node->high)) in emit_case_nodes() 2896 && tree_int_cst_equal (node->left->low, node->left->high) in emit_case_nodes() [all …]
|
H A D | tree-ssa-uninit.c | 706 result = tree_int_cst_equal (val, boundary); in is_value_included_in() 712 result = (tree_int_cst_equal (val, boundary) in is_value_included_in() 719 result = tree_int_cst_equal (val, boundary); in is_value_included_in() 725 result = (tree_int_cst_equal (val, boundary) in is_value_included_in() 1286 && tree_int_cst_equal (cond1_rhs, cond2_rhs)); in is_gcond_subset_of()
|
H A D | tree-switch-conversion.c | 256 && ! tree_int_cst_equal (CASE_LOW (cs), CASE_HIGH (cs))) in check_process_case() 455 gcc_assert (tree_int_cst_equal (pos, CASE_LOW (cs))); in build_constructors()
|
H A D | convert.c | 879 if (!tree_int_cst_equal (TYPE_SIZE (type), TYPE_SIZE (TREE_TYPE (expr)))) in convert_to_integer() 955 if (!tree_int_cst_equal (TYPE_SIZE (type), TYPE_SIZE (TREE_TYPE (expr)))) in convert_to_vector()
|
H A D | tree-ssa.c | 1304 || !tree_int_cst_equal (TYPE_SIZE (outer_type), in useless_type_conversion_p() 1338 || !tree_int_cst_equal (inner_min, outer_min))) in useless_type_conversion_p() 1342 || !tree_int_cst_equal (inner_max, outer_max))) in useless_type_conversion_p()
|
H A D | c-typeck.c | 1151 || !tree_int_cst_equal (TYPE_MIN_VALUE (d1), TYPE_MIN_VALUE (d2)) in comptypes_internal() 1152 || !tree_int_cst_equal (TYPE_MAX_VALUE (d1), TYPE_MAX_VALUE (d2))) in comptypes_internal() 1667 && tree_int_cst_equal (TYPE_SIZE (a1), in type_lists_compatible_p() 1689 && tree_int_cst_equal (TYPE_SIZE (a2), in type_lists_compatible_p() 7310 if (tree_int_cst_equal (first, last)) in set_init_index() 7923 || !tree_int_cst_equal (field, constructor_unfilled_index))) in output_init_element() 8037 if (tree_int_cst_equal (elt->purpose, in output_pending_init_elements() 8091 if (tree_int_cst_equal (elt_bitpos, ctor_unfilled_bitpos)) in output_pending_init_elements() 8527 !p->range_end || tree_int_cst_equal (p->index, p->range_end); in process_init_element() 8537 if (tree_int_cst_equal (p->index, p->range_end) && !p->prev) in process_init_element() [all …]
|
H A D | tree-data-ref.h | 651 return tree_int_cst_equal (fold_unary (ABS_EXPR, TREE_TYPE (stride), in stride_of_unit_type_p()
|
H A D | fold-const.c | 1508 if (tree_int_cst_equal (arg0, arg1)) in size_diffop_loc() 2418 return tree_int_cst_equal (arg0, arg1); in operand_equal_p() 2488 return tree_int_cst_equal (arg0, arg1); in operand_equal_p() 3622 tree_int_cst_equal (mask, in all_ones_mask_p() 3995 if (tree_int_cst_equal (n_low, low) in make_range_step() 3996 && tree_int_cst_equal (n_high, high)) in make_range_step() 4488 if (tree_int_cst_equal (low0, in merge_ranges() 4511 if (tree_int_cst_equal (high1, in merge_ranges() 6918 if (! tree_int_cst_equal (step, s)) in try_move_mult_to_index() 6990 if (! tree_int_cst_equal (step, s)) in try_move_mult_to_index() [all …]
|
/dragonfly/contrib/gcc-8.0/gcc/ |
H A D | tree-switch-conversion.c | 727 && ! tree_int_cst_equal (CASE_LOW (elt), CASE_HIGH (elt))) in collect_switch_conv_info() 979 gcc_assert (tree_int_cst_equal (pos, CASE_LOW (cs))); in build_constructors() 1788 if (!tree_int_cst_equal (root->low, root->high)) in dump_case_nodes() 1826 if (!tree_int_cst_equal (np->low, np->high)) in balance_case_nodes() 1851 if (!tree_int_cst_equal ((*npp)->low, (*npp)->high)) in balance_case_nodes() 2373 else if (tree_int_cst_equal (node->low, node->high)) in emit_case_nodes() 2422 && tree_int_cst_equal (node->left->low, node->left->high) in emit_case_nodes() 2531 || !tree_int_cst_equal (node->left->low, node->left->high)) in emit_case_nodes() 2756 if (tree_int_cst_equal (node->low, TYPE_MIN_VALUE (index_type))) in node_has_low_bound() 2776 if (tree_int_cst_equal (low_minus_one, pnode->high)) in node_has_low_bound() [all …]
|
H A D | gimple-expr.c | 176 || !tree_int_cst_equal (TYPE_SIZE (outer_type), in useless_type_conversion_p() 210 || !tree_int_cst_equal (inner_min, outer_min))) in useless_type_conversion_p() 214 || !tree_int_cst_equal (inner_max, outer_max))) in useless_type_conversion_p()
|
H A D | ipa-icf-gimple.c | 915 if (!tree_int_cst_equal (low1, low2)) in compare_gimple_switch() 921 if (!tree_int_cst_equal (high1, high2)) in compare_gimple_switch() 933 else if (!tree_int_cst_equal (label1, label2)) in compare_gimple_switch()
|
H A D | convert.c | 990 if (!tree_int_cst_equal (TYPE_SIZE (type), TYPE_SIZE (TREE_TYPE (expr)))) in convert_to_integer_1() 1121 if (!tree_int_cst_equal (TYPE_SIZE (type), TYPE_SIZE (TREE_TYPE (expr)))) in convert_to_vector()
|
H A D | tree-data-ref.h | 603 return tree_int_cst_equal (fold_unary (ABS_EXPR, TREE_TYPE (DR_STEP (dr)), in adjacent_dr_p()
|
H A D | gimple.c | 2270 && tree_int_cst_equal (DECL_FIELD_BIT_OFFSET (f1), in gimple_compare_field_offset() 3000 if (tree_int_cst_equal (low, high)) in preprocess_case_label_vec_for_gimple() 3039 && tree_int_cst_equal (CASE_LOW (labels[0]), in preprocess_case_label_vec_for_gimple() 3045 if (tree_int_cst_equal (high, TYPE_MAX_VALUE (index_type))) in preprocess_case_label_vec_for_gimple()
|
H A D | tree-ssa-uninit.c | 1038 result = tree_int_cst_equal (val, boundary); in is_value_included_in() 1050 result = tree_int_cst_equal (val, boundary); in is_value_included_in() 1056 result = (tree_int_cst_equal (val, boundary) in is_value_included_in()
|
H A D | tree-ssa-loop-split.c | 509 || !tree_int_cst_equal (iv.step, niter->control.step)) in split_loop()
|
H A D | tree-ssa-dom.c | 920 : (tree_int_cst_equal (CASE_LOW (label), vr->min) in simplify_stmt_for_jump_threading() 921 && tree_int_cst_equal (vr->min, vr->max))) in simplify_stmt_for_jump_threading()
|
/dragonfly/contrib/gcc-8.0/gcc/lto/ |
H A D | lto-symtab.c | 266 && !tree_int_cst_equal (TYPE_SIZE (type), TYPE_SIZE (prevailing_type))) in warn_type_compatibility_p() 369 && !tree_int_cst_equal (DECL_SIZE (decl), DECL_SIZE (prevailing_decl))) in lto_symtab_merge()
|
/dragonfly/contrib/gcc-8.0/gcc/cp/ |
H A D | constexpr.c | 2249 if (tree_int_cst_equal (lo, new_hi)) 2269 if (tree_int_cst_equal (new_lo, hi)) 2694 if (tree_int_cst_equal (lhs, bailout_value)) in cxx_eval_logical_expression() 2696 gcc_assert (tree_int_cst_equal (lhs, continue_value)); in cxx_eval_logical_expression() 3256 && tree_int_cst_equal (byte_position (field), op01) in cxx_fold_indirect_ref() 3907 else if (tree_int_cst_equal (*jump_target, CASE_LOW (stmt))) in label_matches() 5988 if (tree_int_cst_equal (op, tmp)) in potential_constant_expression_1()
|
H A D | init.c | 262 if (!tree_int_cst_equal (max_index, integer_minus_one_node)) in build_zero_init_1() 267 if (tree_int_cst_equal (size_zero_node, max_index)) in build_zero_init_1() 471 if (!tree_int_cst_equal (max_index, integer_minus_one_node)) in build_value_init_noctor() 476 if (tree_int_cst_equal (size_zero_node, max_index)) in build_value_init_noctor()
|
/dragonfly/contrib/gcc-8.0/gcc/c/ |
H A D | c-typeck.c | 1753 && tree_int_cst_equal (TYPE_SIZE (a1), in type_lists_compatible_p() 1778 && tree_int_cst_equal (TYPE_SIZE (a2), in type_lists_compatible_p() 8590 if (tree_int_cst_equal (first, last)) in set_init_index() 9235 || !tree_int_cst_equal (field, constructor_unfilled_index))) in output_init_element() 9331 if (tree_int_cst_equal (bitpos1, bitpos2)) in init_field_decl_cmp() 9366 if (!tree_int_cst_equal (bit_position (f1), bitpos1)) in init_field_decl_cmp() 9368 if (!tree_int_cst_equal (bit_position (f2), bitpos1)) in init_field_decl_cmp() 9406 if (tree_int_cst_equal (elt->purpose, in output_pending_init_elements() 12663 if (tree_int_cst_equal (size, low_bound)) in handle_omp_array_sections_1() 12677 && tree_int_cst_equal in handle_omp_array_sections_1() [all …]
|
/dragonfly/contrib/gcc-4.7/gcc/cp/ |
H A D | init.c | 255 if (!tree_int_cst_equal (max_index, integer_minus_one_node)) in build_zero_init_1() 260 if (tree_int_cst_equal (size_zero_node, max_index)) in build_zero_init_1() 452 if (!tree_int_cst_equal (max_index, integer_minus_one_node)) in build_value_init_noctor() 457 if (tree_int_cst_equal (size_zero_node, max_index)) in build_value_init_noctor()
|
/dragonfly/contrib/gcc-8.0/gcc/c-family/ |
H A D | c-pretty-print.c | 985 value != NULL_TREE && !tree_int_cst_equal (TREE_VALUE (value), e); in pp_c_enumeration_constant() 1597 && tree_int_cst_equal (TYPE_SIZE (type), TREE_OPERAND (e, 1))) in postfix_expression()
|
H A D | c-warn.c | 299 else if (tree_int_cst_equal (low0, low1) in warn_logical_operator() 300 && tree_int_cst_equal (high0, high1)) in warn_logical_operator()
|
/dragonfly/contrib/gcc-4.7/gcc/c-family/ |
H A D | c-pretty-print.c | 1002 value != NULL_TREE && !tree_int_cst_equal (TREE_VALUE (value), e); in pp_c_enumeration_constant() 1573 && tree_int_cst_equal (TYPE_SIZE (type), TREE_OPERAND (e, 1))) in pp_c_postfix_expression()
|