1*b1e83836Smrg /* Data type conversion
2*b1e83836Smrg Copyright (C) 1987-2022 Free Software Foundation, Inc.
3*b1e83836Smrg
4*b1e83836Smrg This file is part of GCC.
5*b1e83836Smrg
6*b1e83836Smrg GCC is free software; you can redistribute it and/or modify it under
7*b1e83836Smrg the terms of the GNU General Public License as published by the Free
8*b1e83836Smrg Software Foundation; either version 3, or (at your option) any later
9*b1e83836Smrg version.
10*b1e83836Smrg
11*b1e83836Smrg GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12*b1e83836Smrg WARRANTY; without even the implied warranty of MERCHANTABILITY or
13*b1e83836Smrg FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14*b1e83836Smrg for more details.
15*b1e83836Smrg
16*b1e83836Smrg You should have received a copy of the GNU General Public License
17*b1e83836Smrg along with GCC; see the file COPYING3. If not see
18*b1e83836Smrg <http://www.gnu.org/licenses/>. */
19*b1e83836Smrg
20*b1e83836Smrg
21*b1e83836Smrg /* This file contains the functions for converting expressions to
22*b1e83836Smrg different data types for the translation of the gfortran internal
23*b1e83836Smrg representation to GIMPLE. The only entry point is `convert'. */
24*b1e83836Smrg
25*b1e83836Smrg #include "config.h"
26*b1e83836Smrg #include "system.h"
27*b1e83836Smrg #include "coretypes.h"
28*b1e83836Smrg #include "tree.h"
29*b1e83836Smrg #include "fold-const.h"
30*b1e83836Smrg #include "convert.h"
31*b1e83836Smrg
32*b1e83836Smrg #include "gfortran.h"
33*b1e83836Smrg #include "trans.h"
34*b1e83836Smrg #include "trans-types.h"
35*b1e83836Smrg
36*b1e83836Smrg /* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
37*b1e83836Smrg or validate its data type for a GIMPLE `if' or `while' statement.
38*b1e83836Smrg
39*b1e83836Smrg The resulting type should always be `logical_type_node'. */
40*b1e83836Smrg
41*b1e83836Smrg static tree
truthvalue_conversion(tree expr)42*b1e83836Smrg truthvalue_conversion (tree expr)
43*b1e83836Smrg {
44*b1e83836Smrg switch (TREE_CODE (TREE_TYPE (expr)))
45*b1e83836Smrg {
46*b1e83836Smrg case BOOLEAN_TYPE:
47*b1e83836Smrg if (TREE_TYPE (expr) == logical_type_node)
48*b1e83836Smrg return expr;
49*b1e83836Smrg else if (COMPARISON_CLASS_P (expr))
50*b1e83836Smrg {
51*b1e83836Smrg TREE_TYPE (expr) = logical_type_node;
52*b1e83836Smrg return expr;
53*b1e83836Smrg }
54*b1e83836Smrg else if (TREE_CODE (expr) == NOP_EXPR)
55*b1e83836Smrg return fold_build1_loc (input_location, NOP_EXPR,
56*b1e83836Smrg logical_type_node,
57*b1e83836Smrg TREE_OPERAND (expr, 0));
58*b1e83836Smrg else
59*b1e83836Smrg return fold_build1_loc (input_location, NOP_EXPR,
60*b1e83836Smrg logical_type_node,
61*b1e83836Smrg expr);
62*b1e83836Smrg
63*b1e83836Smrg case INTEGER_TYPE:
64*b1e83836Smrg if (TREE_CODE (expr) == INTEGER_CST)
65*b1e83836Smrg return integer_zerop (expr) ? logical_false_node
66*b1e83836Smrg : logical_true_node;
67*b1e83836Smrg else
68*b1e83836Smrg return fold_build2_loc (input_location, NE_EXPR,
69*b1e83836Smrg logical_type_node,
70*b1e83836Smrg expr, build_int_cst (TREE_TYPE (expr), 0));
71*b1e83836Smrg
72*b1e83836Smrg default:
73*b1e83836Smrg gcc_unreachable ();
74*b1e83836Smrg }
75*b1e83836Smrg }
76*b1e83836Smrg
77*b1e83836Smrg /* Create an expression whose value is that of EXPR,
78*b1e83836Smrg converted to type TYPE. The TREE_TYPE of the value
79*b1e83836Smrg is always TYPE. This function implements all reasonable
80*b1e83836Smrg conversions; callers should filter out those that are
81*b1e83836Smrg not permitted by the language being compiled. */
82*b1e83836Smrg
83*b1e83836Smrg tree
convert(tree type,tree expr)84*b1e83836Smrg convert (tree type, tree expr)
85*b1e83836Smrg {
86*b1e83836Smrg tree e = expr;
87*b1e83836Smrg enum tree_code code;
88*b1e83836Smrg
89*b1e83836Smrg if (type == TREE_TYPE (expr))
90*b1e83836Smrg return expr;
91*b1e83836Smrg
92*b1e83836Smrg if (TREE_CODE (type) == ERROR_MARK
93*b1e83836Smrg || TREE_CODE (expr) == ERROR_MARK
94*b1e83836Smrg || TREE_CODE (TREE_TYPE (expr)) == ERROR_MARK)
95*b1e83836Smrg return expr;
96*b1e83836Smrg
97*b1e83836Smrg gcc_checking_assert (TREE_CODE (TREE_TYPE (expr)) != VOID_TYPE);
98*b1e83836Smrg
99*b1e83836Smrg if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (TREE_TYPE (expr)))
100*b1e83836Smrg return fold_build1_loc (input_location, NOP_EXPR, type, expr);
101*b1e83836Smrg
102*b1e83836Smrg code = TREE_CODE (type);
103*b1e83836Smrg if (code == VOID_TYPE)
104*b1e83836Smrg return fold_build1_loc (input_location, CONVERT_EXPR, type, e);
105*b1e83836Smrg if (code == BOOLEAN_TYPE)
106*b1e83836Smrg return fold_build1_loc (input_location, NOP_EXPR, type,
107*b1e83836Smrg truthvalue_conversion (e));
108*b1e83836Smrg if (code == INTEGER_TYPE)
109*b1e83836Smrg return fold (convert_to_integer (type, e));
110*b1e83836Smrg if (code == POINTER_TYPE || code == REFERENCE_TYPE)
111*b1e83836Smrg return fold (convert_to_pointer (type, e));
112*b1e83836Smrg if (code == REAL_TYPE)
113*b1e83836Smrg return fold (convert_to_real (type, e));
114*b1e83836Smrg if (code == COMPLEX_TYPE)
115*b1e83836Smrg return fold (convert_to_complex (type, e));
116*b1e83836Smrg if (code == VECTOR_TYPE)
117*b1e83836Smrg return fold (convert_to_vector (type, e));
118*b1e83836Smrg
119*b1e83836Smrg gcc_unreachable ();
120*b1e83836Smrg }
121*b1e83836Smrg
122