Home
last modified time | relevance | path

Searched refs:fold_convert (Results 1 – 25 of 75) sorted by relevance

123

/freebsd-12-stable/contrib/gcc/
Dfold-const.c1341 tree temp = fold_convert (ntype, TREE_OPERAND (t, 0)); in fold_negate_expr()
1343 return fold_convert (type, temp); in fold_negate_expr()
1373 return fold_convert (type, tem); in negate_expr()
1492 return build2 (MINUS_EXPR, type, fold_convert (type, t2), in associate_trees()
1493 fold_convert (type, TREE_OPERAND (t1, 0))); in associate_trees()
1495 return build2 (MINUS_EXPR, type, fold_convert (type, t1), in associate_trees()
1496 fold_convert (type, TREE_OPERAND (t2, 0))); in associate_trees()
1498 return fold_convert (type, t1); in associate_trees()
1503 return fold_convert (type, t1); in associate_trees()
1506 return build2 (code, type, fold_convert (type, t1), in associate_trees()
[all …]
Dtree-ssa-address.c253 addr_base = fold_convert (type, build_addr (sym, current_function_decl)); in tree_mem_ref_addr()
256 addr_base = fold_convert (type, base); in tree_mem_ref_addr()
287 addr = fold_convert (type, addr_off); in tree_mem_ref_addr()
443 fold_convert (type, elt)); in add_to_parts()
487 elt = fold_convert (sizetype, addr->elts[i]); in most_expensive_mult_to_index()
540 part = fold_convert (sizetype, addr->elts[i]); in addr_to_parts()
547 add_to_parts (parts, fold_convert (sizetype, addr->rest)); in addr_to_parts()
600 tmp = fold_convert (addr_type, in create_mem_ref()
609 fold_convert (addr_type, parts.base), in create_mem_ref()
636 fold_convert (atype, parts.index)), in create_mem_ref()
[all …]
Dtree-ssa-loop-niter.c151 s = fold_convert (niter_type, in number_of_iterations_ne()
154 fold_convert (niter_type, iv->base), in number_of_iterations_ne()
155 fold_convert (niter_type, final)); in number_of_iterations_ne()
159 s = fold_convert (niter_type, iv->step); in number_of_iterations_ne()
161 fold_convert (niter_type, final), in number_of_iterations_ne()
162 fold_convert (niter_type, iv->base)); in number_of_iterations_ne()
224 tmod = fold_convert (type, mod); in number_of_iterations_lt_to_ne()
302 fold_convert (niter_type, TYPE_MAX_VALUE (type)), in assert_no_overflow_lt()
303 fold_convert (niter_type, iv0->base)); in assert_no_overflow_lt()
310 TYPE_MAX_VALUE (type), fold_convert (type, diff)); in assert_no_overflow_lt()
[all …]
Dc-convert.c91 return fold_convert (type, expr); in convert()
100 return fold_convert (type, e); in convert()
104 return fold_convert (type, c_objc_common_truthvalue_conversion (expr)); in convert()
Domp-low.c333 t = fold_convert (long_integer_type_node, fd.chunk_size); in get_ws_args_for()
337 t = fold_convert (long_integer_type_node, fd.step); in get_ws_args_for()
340 t = fold_convert (long_integer_type_node, fd.n2); in get_ws_args_for()
343 t = fold_convert (long_integer_type_node, fd.n1); in get_ws_args_for()
1549 return fold_convert (type, integer_zero_node); in omp_reduction_init()
1555 return fold_convert (type, integer_one_node); in omp_reduction_init()
1558 return fold_convert (type, integer_minus_one_node); in omp_reduction_init()
1685 x = fold_convert (TREE_TYPE (ptr), x); in lower_rec_input_clauses()
1719 x = fold_convert (TREE_TYPE (new_var), x); in lower_rec_input_clauses()
2201 val = fold_convert (unsigned_type_node, val); in expand_parallel_call()
[all …]
Dexpr.h132 (TO).var = fold_convert (ssizetype, inc); \
135 fold_convert (ssizetype, inc)); \
145 fold_convert (ssizetype, dec)); \
148 fold_convert (ssizetype, dec)); \
155 : size_binop (PLUS_EXPR, fold_convert (ssizetype, (SIZE).var), \
Dtree-ssa-loop-ivopts.c863 return fold_convert (ptr_type_node, in determine_base_object()
882 return fold_convert (ptr_type_node, expr); in determine_base_object()
985 base = fold_convert (type, base); in find_bivs()
987 step = fold_convert (type, step); in find_bivs()
1838 return fold_convert (orig_type, expr); in strip_offset_1()
1889 return fold_convert (orig_type, expr); in strip_offset_1()
1917 expr = fold_convert (orig_type, expr); in strip_offset_1()
1990 base = fold_convert (type, base); in add_candidate_1()
1992 step = fold_convert (type, step); in add_candidate_1()
2741 elt = fold_convert (comb->type, elt); in aff_combination_add_elt()
[all …]
Dbuiltins.c3095 newarglist = build_tree_list (NULL_TREE, fold_convert (sizetype, size)); in expand_builtin_bcopy()
3547 newarglist = build_tree_list (NULL_TREE, fold_convert (sizetype, size)); in expand_builtin_bzero()
3894 fold_convert (TREE_TYPE (len), arg3)); in expand_builtin_strncmp()
3988 newdst = fold_convert (TREE_TYPE (dst), newdst); in expand_builtin_strcat()
4272 t = fold_convert (TREE_TYPE (valist), size_int (boundary - 1)); in std_gimplify_va_arg_expr()
4277 t = fold_convert (TREE_TYPE (valist), size_int (-boundary)); in std_gimplify_va_arg_expr()
4310 t = fold_convert (TREE_TYPE (addr), t); in std_gimplify_va_arg_expr()
4315 t = fold_convert (TREE_TYPE (valist), rounded_size); in std_gimplify_va_arg_expr()
4320 addr = fold_convert (build_pointer_type (type), addr); in std_gimplify_va_arg_expr()
6702 len = fold_convert (size_type_node, len); in fold_builtin_strlen()
[all …]
Dstor-layout.c333 = fold_convert (sizetype, size_binop (CEIL_DIV_EXPR, DECL_SIZE (decl), in layout_decl()
555 fold_convert (bitsizetype, offset), in bit_from_pos()
563 fold_convert (sizetype, in byte_from_pos()
573 fold_convert (sizetype, in pos_from_bit()
596 fold_convert (sizetype, extra_aligns), in normalize_offset()
922 fold_convert (sizetype, in place_field()
1194 fold_convert (sizetype, in place_field()
1425 = fold_convert (sizetype, in finalize_type_size()
1723 fold_convert (sizetype, in layout_type()
1755 fold_convert (bitsizetype, in layout_type()
Dtree-object-size.c137 t = fold_convert (sizetype, t); in compute_object_offset()
266 bytes = fold_convert (sizetype, arg); in alloc_object_size()
269 fold_convert (sizetype, arg)); in alloc_object_size()
1026 result = fold_convert (size_type_node, in compute_object_sizes()
Dtree-ssa-ccp.c967 return fold_convert (TREE_TYPE (rhs), retval); in ccp_fold()
1610 min_idx = fold_convert (TYPE_DOMAIN (array_type), min_idx); in maybe_fold_offset_to_array_ref()
1615 idx = fold_convert (TYPE_DOMAIN (array_type), idx); in maybe_fold_offset_to_array_ref()
1616 elt_offset = fold_convert (TYPE_DOMAIN (array_type), elt_offset); in maybe_fold_offset_to_array_ref()
1903 array_idx = fold_convert (TREE_TYPE (min_idx), array_idx); in maybe_fold_stmt_addition()
1911 array_idx = fold_convert (sizetype, array_idx); in maybe_fold_stmt_addition()
2284 tree new = fold_convert (TREE_TYPE (fn), val[0]); in ccp_fold_builtin()
Dtree-data-ref.c1103 step = fold_convert (ssizetype, evolution); in analyze_indirect_ref()
1261 *initial_offset = fold_convert (ssizetype, expr); in analyze_offset_expr()
1262 *misalign = fold_convert (ssizetype, expr); in analyze_offset_expr()
1291 *misalign = fold_convert (ssizetype, init); in analyze_offset_expr()
1296 *initial_offset = fold_convert (ssizetype, init); in analyze_offset_expr()
1298 *step = evolution ? fold_convert (ssizetype, evolution) : ssize_int (0); in analyze_offset_expr()
1404 *initial_offset = fold_convert (ssizetype, in analyze_offset_expr()
1485 fold_convert (ssizetype, oprnd1) : fold_convert (ssizetype, oprnd0); in address_analysis()
1993 type_size = fold_convert (ssizetype, TYPE_SIZE_UNIT (TREE_TYPE (DR_REF (dr)))); in create_data_ref()
2013 invariant = fold_convert (type, invariant); in create_data_ref()
[all …]
Dtree-chrec.c309 fold_convert (type, op0), in chrec_fold_plus_1()
310 fold_convert (type, op1)); in chrec_fold_plus_1()
429 return fold_convert (type, n); in tree_fold_binomial()
1293 res = fold_convert (type, chrec); in chrec_convert_1()
Dtree-dfa.c917 fold_convert (bitsizetype, in get_ref_base_and_extent()
954 fold_convert (sizetype, index), unit_size); in get_ref_base_and_extent()
958 fold_convert (bitsizetype, index), in get_ref_base_and_extent()
Dgimplify.c1247 t = fold_convert (ptr_type, t); in gimplify_decl_expr()
2403 return fold_convert (boolean_type_node, expr); in gimple_boolify()
2801 fold_convert (var_type, in gimplify_init_ctor_eval_range()
3127 tree zero = fold_convert (TREE_TYPE (type), integer_zero_node); in gimplify_init_constructor()
3685 fold_convert (type, boolean_true_node), in gimplify_boolean_expr()
3686 fold_convert (type, boolean_false_node)); in gimplify_boolean_expr()
3861 op00 = fold_convert (TREE_TYPE (expr), op00); in gimplify_addr_expr()
3881 *expr_p = fold_convert (TREE_TYPE (expr), in gimplify_addr_expr()
5127 args = tree_cons (NULL, fold_convert (itype, rhs), NULL); in gimplify_omp_atomic_fetch_op()
5232 iaddr = fold_convert (build_pointer_type (itype), addr); in gimplify_omp_atomic_pipeline()
[all …]
Dtree-profile.c127 return force_gimple_operand_bsi (bsi, fold_convert (gcov_type_node, val), in prepare_instrumented_value()
Dtree-ssa-forwprop.c342 fold_convert (TREE_TYPE (def_rhs), in forward_propagate_into_cond_1()
395 fold_convert (TREE_TYPE (new_arg), in forward_propagate_into_cond_1()
Dtree-ssa-reassoc.c464 add_to_ops_vec (ops, fold_convert (TREE_TYPE (last->op), in eliminate_duplicate_pair()
528 add_to_ops_vec (ops, fold_convert(TREE_TYPE (oe->op), in eliminate_plus_minus_pair()
591 oe->op = fold_convert (TREE_TYPE (oe->op), integer_zero_node); in eliminate_not_pairs()
Dtree-ssa-phiopt.c423 cond = fold_convert (TREE_TYPE (result), cond); in conditional_replacement()
521 cond = fold_convert (TREE_TYPE (result), cond_tmp); in conditional_replacement()
Dtree-tailcall.c937 fold_convert (ret_type, integer_zero_node), in tree_optimize_tail_calls_1()
953 fold_convert (ret_type, integer_one_node), in tree_optimize_tail_calls_1()
Dc-omp.c178 return fold_convert (TREE_TYPE (exp), t); in check_omp_for_incr_expr()
Dexpr.c4339 exp = fold_convert in store_expr()
4343 exp = fold_convert (lang_hooks.types.type_for_mode in store_expr()
5028 value = fold_convert (type, value); in store_constructor()
5233 fold_convert (ssizetype, in store_constructor()
5241 fold_convert (ssizetype, in store_constructor()
5280 index = fold_convert (ssizetype, in store_constructor()
5288 fold_convert (ssizetype, in store_constructor()
5743 fold_convert (sizetype, index), in get_inner_reference()
5859 aligned_size = fold_convert (sizetype, aligned_size); in array_ref_element_size()
5925 aligned_offset = fold_convert (sizetype, aligned_offset); in component_ref_field_offset()
[all …]
Dstmt.c2114 low = fold_convert (type, low); in add_case_node()
2131 low = fold_convert (type, low); in add_case_node()
2138 high = fold_convert (type, high); in add_case_node()
2275 fold_convert (index_type, index_expr), in emit_case_bit_tests()
2276 fold_convert (index_type, minval)); in emit_case_bit_tests()
Ddojump.c281 do_jump (fold_convert (type, exp), if_false_label, if_true_label); in do_jump()
340 do_jump (fold_convert (type, exp), if_false_label, if_true_label); in do_jump()
/freebsd-12-stable/contrib/gcc/cp/
Dcp-gimplify.c614 *expr_p = (TREE_TYPE (arg) != type) ? fold_convert (type, arg) in cp_gimplify_expr()
841 end1 = fold_convert (TREE_TYPE (start1), end1); in cxx_omp_clause_apply_fn()
871 t = fold_convert (TREE_TYPE (p1), TYPE_SIZE_UNIT (inner_type)); in cxx_omp_clause_apply_fn()
878 t = fold_convert (TREE_TYPE (p2), TYPE_SIZE_UNIT (inner_type)); in cxx_omp_clause_apply_fn()

123