Home
last modified time | relevance | path

Searched refs:tree_int_cst_equal (Results 1 – 25 of 29) sorted by relevance

12

/freebsd-12.1/contrib/gcc/
H A Dstmt.c2106 if (!high || tree_int_cst_equal (low, high)) in add_case_node()
2412 if (! tree_int_cst_equal (n->low, n->high)) in expand_case()
2725 if (!tree_int_cst_equal (np->low, np->high)) in balance_case_nodes()
2753 if (!tree_int_cst_equal ((*npp)->low, (*npp)->high)) in balance_case_nodes()
2785 if (!tree_int_cst_equal ((*npp)->low, (*npp)->high)) in balance_case_nodes()
2833 if (tree_int_cst_equal (node->low, TYPE_MIN_VALUE (index_type))) in node_has_low_bound()
2854 if (tree_int_cst_equal (low_minus_one, pnode->high)) in node_has_low_bound()
2905 if (tree_int_cst_equal (high_plus_one, pnode->low)) in node_has_high_bound()
2966 else if (tree_int_cst_equal (node->low, node->high)) in emit_case_nodes()
3015 && tree_int_cst_equal (node->left->low, node->left->high) in emit_case_nodes()
[all …]
H A Dtree-sra.c505 return tree_int_cst_equal (ae, be); in sra_elt_eq()
509 tree_int_cst_equal (TREE_OPERAND (ae, 0), TREE_OPERAND (be, 0)) in sra_elt_eq()
510 && tree_int_cst_equal (TREE_OPERAND (ae, 1), TREE_OPERAND (be, 1)); in sra_elt_eq()
1353 if (tree_int_cst_equal (i, max)) in instantiate_missing_elements()
1839 if (tree_int_cst_equal (lower, upper)) in generate_element_init_1()
H A Dconvert.c787 if (!tree_int_cst_equal (TYPE_SIZE (type), TYPE_SIZE (TREE_TYPE (expr)))) in convert_to_integer()
862 if (!tree_int_cst_equal (TYPE_SIZE (type), TYPE_SIZE (TREE_TYPE (expr)))) in convert_to_vector()
H A Dc-typeck.c915 || !tree_int_cst_equal (TYPE_MIN_VALUE (d1), TYPE_MIN_VALUE (d2)) in comptypes_internal()
916 || !tree_int_cst_equal (TYPE_MAX_VALUE (d1), TYPE_MAX_VALUE (d2))) in comptypes_internal()
1394 && tree_int_cst_equal (TYPE_SIZE (a1), in type_lists_compatible_p()
1415 && tree_int_cst_equal (TYPE_SIZE (a2), in type_lists_compatible_p()
6013 if (tree_int_cst_equal (first, last)) in set_init_index()
6579 || !tree_int_cst_equal (field, constructor_unfilled_index))) in output_init_element()
6688 if (tree_int_cst_equal (elt->purpose, in output_pending_init_elements()
6741 if (tree_int_cst_equal (elt_bitpos, ctor_unfilled_bitpos)) in output_pending_init_elements()
7132 !p->range_end || tree_int_cst_equal (p->index, p->range_end); in process_init_element()
7140 if (tree_int_cst_equal (p->index, p->range_end) && !p->prev) in process_init_element()
[all …]
H A Dtree-ssa-forwprop.c485 if (is_gimple_val (new) && tree_int_cst_equal (new, op1)) in find_equivalent_equality_comparison()
H A Dfold-const.c1938 if (tree_int_cst_equal (arg0, arg1)) in size_diffop()
2691 && tree_int_cst_equal (arg0, arg1)); in operand_equal_p()
2811 && (tree_int_cst_equal (TREE_OPERAND (arg0, 1), in operand_equal_p()
3740 tree_int_cst_equal (mask, in all_ones_mask_p()
4101 if (tree_int_cst_equal (n_low, low) in make_range()
4102 && tree_int_cst_equal (n_high, high)) in make_range()
4531 if (tree_int_cst_equal (low0, in merge_ranges()
4554 if (tree_int_cst_equal (high1, in merge_ranges()
6849 if (! tree_int_cst_equal (step, s)) in try_move_mult_to_index()
13195 result = tree_int_cst_equal (op0, op1); in fold_relational_const()
[all …]
H A Dc-pretty-print.c918 value != NULL_TREE && !tree_int_cst_equal (TREE_VALUE (value), e); in pp_c_enumeration_constant()
H A Dc-common.c1127 && tree_int_cst_equal (TYPE_SIZE (t1), TYPE_SIZE (t2))) in vector_types_convertible_p()
1131 (tree_int_cst_equal (TYPE_SIZE (t1), TYPE_SIZE (t2)) in vector_types_convertible_p()
3781 if (tree_int_cst_equal (low_value, high_value)) in c_add_case_label()
H A Dtree-ssa-ccp.c1057 if (tree_int_cst_equal (cfield, idx)) in fold_const_aggregate_ref()
H A Dtree.c4195 || tree_int_cst_equal (TYPE_MAX_VALUE (a->type), in type_hash_eq()
4198 || tree_int_cst_equal (TYPE_MIN_VALUE (a->type), in type_hash_eq()
4477 tree_int_cst_equal (tree t1, tree t2) in tree_int_cst_equal() function
H A Dtree-vrp.c2108 && tree_int_cst_equal (new_min, orig_min) in extract_range_from_unary_expr()
2109 && tree_int_cst_equal (new_max, orig_max) in extract_range_from_unary_expr()
H A Dtree-data-ref.c573 return tree_int_cst_equal (a, tree_fold_gcd (a, b)); in tree_fold_divides_p()
H A Dtree.h3701 extern int tree_int_cst_equal (tree, tree);
H A Dexpr.c7307 if (tree_int_cst_equal (field, index)) in expand_expr_real_1()
7335 if (tree_int_cst_equal (field, index)) in expand_expr_real_1()
H A Dvarasm.c2564 return tree_int_cst_equal (t1, t2); in compare_constant()
H A Dtree-cfg.c1157 && tree_int_cst_equal (CASE_LOW (merge_case), t)) in group_case_labels()
H A Ddwarf2out.c8399 && tree_int_cst_equal (TYPE_MIN_VALUE (type), TYPE_MIN_VALUE (subtype)) in is_subrange_type()
8402 && tree_int_cst_equal (TYPE_MAX_VALUE (type), TYPE_MAX_VALUE (subtype))) in is_subrange_type()
H A Dbuiltins.c369 if (tree_int_cst_equal (len1, len2)) in c_strlen()
/freebsd-12.1/contrib/gcc/cp/
H A Dinit.c234 if (!tree_int_cst_equal (max_index, integer_minus_one_node)) in build_zero_init()
242 if (tree_int_cst_equal (size_zero_node, max_index)) in build_zero_init()
H A Dmethod.c117 ? tree_int_cst_equal (THUNK_VIRTUAL_OFFSET (thunk), in make_thunk()
H A Dclass.c876 || !tree_int_cst_equal (delta, BV_DELTA (v))) in modify_vtable_entry()
4566 gcc_assert (tree_int_cst_equal in include_empty_classes()
4777 && !tree_int_cst_equal (DECL_FIELD_OFFSET (field), in layout_class_type()
7485 gcc_assert (tree_int_cst_equal (delta, BINFO_VPTR_FIELD (vbase))); in build_vbase_offset_vtbl_entries()
7806 gcc_assert (tree_int_cst_equal (OBJ_TYPE_REF_TOKEN (ref), in cp_fold_obj_type_ref()
H A Dcall.c5027 if (tree_int_cst_equal (TYPE_SIZE (type), TYPE_SIZE (as_base))) in build_over_call()
H A Dtypeck.c3572 if (!tree_int_cst_equal (TYPE_SIZE (type0), TYPE_SIZE (type1)) in build_binary_op()
H A Dpt.c10824 return !tree_int_cst_equal (parm, arg); in unify()
/freebsd-12.1/contrib/gcc/doc/
H A Dc-tree.texi1831 @findex tree_int_cst_equal
2004 ignored. Similarly, @code{tree_int_cst_equal} holds if the two

12