Home
last modified time | relevance | path

Searched refs:TYPE_MIN_VALUE (Results 1 – 25 of 38) sorted by relevance

12

/freebsd-12.1/contrib/gcc/
H A Dtree-vrp.c122 return (TYPE_MIN_VALUE (type) != NULL_TREE in supports_overflow_infinity()
123 && CONSTANT_CLASS_P (TYPE_MIN_VALUE (type)) in supports_overflow_infinity()
215 return TYPE_MIN_VALUE (TREE_TYPE (val)); in avoid_overflow_infinity()
1156 min = TYPE_MIN_VALUE (type); in extract_range_from_assert()
1590 : TYPE_MIN_VALUE (TREE_TYPE (res))); in vrp_int_const_binop()
2096 orig_min = TYPE_MIN_VALUE (inner_type); in extract_range_from_unary_expr()
2170 min = TYPE_MIN_VALUE (TREE_TYPE (expr)); in extract_range_from_unary_expr()
2189 max = TYPE_MIN_VALUE (TREE_TYPE (expr)); in extract_range_from_unary_expr()
2527 tmin = TYPE_MIN_VALUE (type); in adjust_range_with_scev()
4052 && TYPE_MIN_VALUE (TREE_TYPE (lhs)) in vrp_visit_assignment()
[all …]
H A Dstor-layout.c1582 if (TREE_CODE (TYPE_MIN_VALUE (type)) == INTEGER_CST in layout_type()
1583 && tree_int_cst_sgn (TYPE_MIN_VALUE (type)) >= 0) in layout_type()
1712 if (index && TYPE_MAX_VALUE (index) && TYPE_MIN_VALUE (index) in layout_type()
1716 tree lb = TYPE_MIN_VALUE (index); in layout_type()
1733 && host_integerp (TYPE_MIN_VALUE (element), 1)) in layout_type()
1738 = tree_low_cst (TYPE_MIN_VALUE (element), 1); in layout_type()
1750 && TREE_CODE (TYPE_MIN_VALUE (index)) != INTEGER_CST in layout_type()
2059 TYPE_MIN_VALUE (type) = min_value; in set_min_and_max_values_for_integral_type()
H A Dtree-ssa-loop-niter.c253 TYPE_MIN_VALUE (type), tmod); in number_of_iterations_lt_to_ne()
324 fold_convert (niter_type, TYPE_MIN_VALUE (type))); in assert_no_overflow_lt()
331 TYPE_MIN_VALUE (type), fold_convert (type, diff)); in assert_no_overflow_lt()
368 TYPE_MIN_VALUE (type), diff); in assert_loop_rolls_lt()
517 iv0->base, TYPE_MIN_VALUE (type)); in number_of_iterations_le()
1798 || TYPE_MIN_VALUE (type) == NULL_TREE in infer_loop_bounds_from_undefined()
1808 TYPE_MIN_VALUE (type)); in infer_loop_bounds_from_undefined()
H A Ddbxout.c1611 if (TYPE_MIN_VALUE (type) != 0 in dbxout_range_type()
1612 && host_integerp (TYPE_MIN_VALUE (type), 0)) in dbxout_range_type()
1615 stabstr_O (TYPE_MIN_VALUE (type)); in dbxout_range_type()
1617 stabstr_D (tree_low_cst (TYPE_MIN_VALUE (type), 0)); in dbxout_range_type()
1898 stabstr_O (TYPE_MIN_VALUE (type)); in dbxout_type()
2252 && TYPE_MIN_VALUE (type) != 0 in print_int_cst_bounds_in_octal_p()
2253 && TREE_CODE (TYPE_MIN_VALUE (type)) == INTEGER_CST in print_int_cst_bounds_in_octal_p()
H A Dsdbout.c568 && TYPE_MIN_VALUE (TYPE_DOMAIN (type)) != 0 in plain_type_1()
571 && host_integerp (TYPE_MIN_VALUE (TYPE_DOMAIN (type)), 0) in plain_type_1()
573 - tree_low_cst (TYPE_MIN_VALUE (TYPE_DOMAIN (type)), 0) + 1) in plain_type_1()
H A Dtree-sra.c276 if (TYPE_MIN_VALUE (t) == NULL || !TREE_CONSTANT (TYPE_MIN_VALUE (t))) in sra_type_can_be_decomposed_p()
615 TYPE_MIN_VALUE (domain), TYPE_MAX_VALUE (domain)); in maybe_lookup_element_for_expr()
1346 i = TYPE_MIN_VALUE (TYPE_DOMAIN (type)); in instantiate_missing_elements()
H A Dtree.c1922 min = TYPE_MIN_VALUE (index_type); in array_type_nelts()
4197 && (TYPE_MIN_VALUE (a->type) == TYPE_MIN_VALUE (b->type) in type_hash_eq()
4198 || tree_int_cst_equal (TYPE_MIN_VALUE (a->type), in type_hash_eq()
4199 TYPE_MIN_VALUE (b->type)))); in type_hash_eq()
5137 TYPE_MIN_VALUE (itype) = size_zero_node; in build_index_type()
5186 TYPE_MIN_VALUE (itype) = fold_convert (type, lowval); in build_range_type()
5687 tree type_low_bound = TYPE_MIN_VALUE (type); in int_fits_type_p()
5835 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type)); in variably_modified_type_p()
6572 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node); in build_common_tree_nodes_2()
7066 range_min = TYPE_MIN_VALUE (domain_type); in range_in_array_bounds_p()
[all …]
H A Dgimplify.c1596 || !TYPE_DOMAIN (datype) || !TYPE_MIN_VALUE (TYPE_DOMAIN (datype)) in canonicalize_addr_expr()
1597 || TREE_CODE (TYPE_MIN_VALUE (TYPE_DOMAIN (datype))) != INTEGER_CST) in canonicalize_addr_expr()
1602 TYPE_MIN_VALUE (TYPE_DOMAIN (datype)), in canonicalize_addr_expr()
3247 if (type_domain && TYPE_MIN_VALUE (type_domain)) in fold_indirect_ref_rhs()
3248 min_val = TYPE_MIN_VALUE (type_domain); in fold_indirect_ref_rhs()
3264 if (type_domain && TYPE_MIN_VALUE (type_domain)) in fold_indirect_ref_rhs()
3265 min_val = TYPE_MIN_VALUE (type_domain); in fold_indirect_ref_rhs()
4369 omp_firstprivatize_variable (ctx, TYPE_MIN_VALUE (type)); in omp_firstprivatize_type_sizes()
6102 gimplify_one_sizepos (&TYPE_MIN_VALUE (type), list_p); in gimplify_type_sizes()
6107 TYPE_MIN_VALUE (t) = TYPE_MIN_VALUE (type); in gimplify_type_sizes()
H A Dtree-ssa.c974 && simple_cst_equal (TYPE_MIN_VALUE (inner_type), TYPE_MIN_VALUE (outer_type))) in tree_ssa_useless_type_conversion_1()
H A Dtree-ssa-ccp.c1607 if (TYPE_MIN_VALUE (TYPE_DOMAIN (array_type))) in maybe_fold_offset_to_array_ref()
1608 min_idx = TYPE_MIN_VALUE (TYPE_DOMAIN (array_type)); in maybe_fold_offset_to_array_ref()
1897 min_idx = TYPE_MIN_VALUE (min_idx); in maybe_fold_stmt_addition()
H A Dc-typeck.c343 && (TREE_CODE (TYPE_MIN_VALUE (d1)) != INTEGER_CST in composite_type()
346 && (TREE_CODE (TYPE_MIN_VALUE (d2)) != INTEGER_CST in composite_type()
902 && (TREE_CODE (TYPE_MIN_VALUE (d1)) != INTEGER_CST in comptypes_internal()
905 && (TREE_CODE (TYPE_MIN_VALUE (d2)) != INTEGER_CST in comptypes_internal()
915 || !tree_int_cst_equal (TYPE_MIN_VALUE (d1), TYPE_MIN_VALUE (d2)) in comptypes_internal()
5502 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type))); in really_start_incremental_init()
5704 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type))); in push_init_level()
6349 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type))); in set_nonincremental_init()
H A Dtree-browser.c175 TB_SET_HEAD (TYPE_MIN_VALUE (head)); in browse_tree()
H A Dfold-const.c2031 tree lt = TYPE_MIN_VALUE (type); in fold_convert_const_int_from_real()
4365 && operand_equal_p (val, TYPE_MIN_VALUE (type), 0)) in range_predecessor()
4532 TYPE_MIN_VALUE (TREE_TYPE (low0)))) in merge_ranges()
4828 if (! operand_equal_p (arg2, TYPE_MIN_VALUE (type), in fold_cond_expr_with_comparison()
4840 if (! operand_equal_p (arg2, TYPE_MIN_VALUE (type), in fold_cond_expr_with_comparison()
8328 tree minval = TYPE_MIN_VALUE (TREE_TYPE (cval1)); in fold_comparison()
12022 fold_checksum_tree (TYPE_MIN_VALUE (expr), ctx, ht); in fold_checksum_tree()
13315 if (type_domain && TYPE_MIN_VALUE (type_domain)) in fold_indirect_ref_1()
13316 min_val = TYPE_MIN_VALUE (type_domain); in fold_indirect_ref_1()
13353 if (type_domain && TYPE_MIN_VALUE (type_domain)) in fold_indirect_ref_1()
[all …]
H A Dexpr.c4744 && TYPE_MIN_VALUE (TYPE_DOMAIN (tf)) in count_type_elements()
4745 && integer_zerop (TYPE_MIN_VALUE (TYPE_DOMAIN (tf))) in count_type_elements()
5066 const_bounds_p = (TYPE_MIN_VALUE (domain) in store_constructor()
5068 && host_integerp (TYPE_MIN_VALUE (domain), 0) in store_constructor()
5074 minelt = tree_low_cst (TYPE_MIN_VALUE (domain), 0); in store_constructor()
5237 TYPE_MIN_VALUE (domain))); in store_constructor()
5284 TYPE_MIN_VALUE (domain))); in store_constructor()
5884 if (domain_type && TYPE_MIN_VALUE (domain_type)) in array_ref_low_bound()
5885 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MIN_VALUE (domain_type), exp); in array_ref_low_bound()
H A Dprint-tree.c614 print_node_brief (file, "min", TYPE_MIN_VALUE (node), indent + 4); in print_node()
H A Dtree-dump.c445 dump_child ("min", TYPE_MIN_VALUE (t)); in dequeue_and_dump()
H A Dc-decl.c5853 TYPE_MIN_VALUE (ref) = TYPE_MIN_VALUE (unsigned_type_node); in parser_xref_tag()
6422 TYPE_MIN_VALUE (enumtype) = TYPE_MIN_VALUE (tem); in finish_enum()
6489 TYPE_MIN_VALUE (tem) = TYPE_MIN_VALUE (enumtype); in finish_enum()
H A Dtree-inline.c270 t = TYPE_MIN_VALUE (new); in remap_type_1()
272 walk_tree (&TYPE_MIN_VALUE (new), copy_body_r, id, NULL); in remap_type_1()
H A Ddwarf2out.c8397 && TYPE_MIN_VALUE (type) != NULL in is_subrange_type()
8398 && TYPE_MIN_VALUE (subtype) != NULL in is_subrange_type()
8399 && tree_int_cst_equal (TYPE_MIN_VALUE (type), TYPE_MIN_VALUE (subtype)) in is_subrange_type()
8451 if (TYPE_MIN_VALUE (type) != NULL) in subrange_type_die()
8453 TYPE_MIN_VALUE (type)); in subrange_type_die()
10097 && integer_zerop (TYPE_MIN_VALUE (domain)) in rtl_for_decl_init()
10800 lower = TYPE_MIN_VALUE (domain); in add_subscript_info()
H A Dstmt.c2099 min_value = TYPE_MIN_VALUE (type); in add_case_node()
2833 if (tree_int_cst_equal (node->low, TYPE_MIN_VALUE (index_type))) in node_has_low_bound()
H A Dc-common.c1641 min_value = TYPE_MIN_VALUE (orig_type); in check_case_bounds()
2209 minval = TYPE_MIN_VALUE (type); in shorten_compare()
2305 primop1 = TYPE_MIN_VALUE (type); in shorten_compare()
H A Dtree.def155 Has components TYPE_MIN_VALUE, TYPE_MAX_VALUE (expressions, inclusive)
415 Operand 2, if present, is a copy of TYPE_MIN_VALUE of the index.
H A Dvarasm.c4184 tmp = TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (val))); in array_size_for_constructor()
4221 min_index = TYPE_MIN_VALUE (TYPE_DOMAIN (type)); in output_constructor()
/freebsd-12.1/contrib/gcc/cp/
H A Dtypeck2.c795 - TREE_INT_CST_LOW (TYPE_MIN_VALUE (domain)) in process_init_constructor_array()
/freebsd-12.1/contrib/gcc/doc/
H A Dc-tree.texi271 @tindex TYPE_MIN_VALUE
442 The @code{TYPE_MIN_VALUE} is an @code{INTEGER_CST} for the smallest
461 with @code{TYPE_MIN_VALUE} and @code{TYPE_MAX_VALUE}, respectively; each
516 @code{TYPE_MIN_VALUE} and @code{TYPE_MAX_VALUE} will be the lower and
517 upper bounds of the array, respectively. The @code{TYPE_MIN_VALUE} will

12