1 /* Routines for reading GIMPLE from a file stream.
3 Copyright (C) 2011-2014 Free Software Foundation, Inc.
4 Contributed by Diego Novillo <dnovillo@google.com>
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
24 #include "coretypes.h"
25 #include "diagnostic.h"
27 #include "basic-block.h"
28 #include "tree-ssa-alias.h"
29 #include "internal-fn.h"
31 #include "gimple-expr.h"
34 #include "gimple-iterator.h"
35 #include "gimple-ssa.h"
36 #include "tree-phinodes.h"
37 #include "stringpool.h"
38 #include "tree-ssanames.h"
39 #include "data-streamer.h"
40 #include "tree-streamer.h"
41 #include "gimple-streamer.h"
42 #include "value-prof.h"
44 /* Read a PHI function for basic block BB in function FN. DATA_IN is
45 the file being read. IB is the input block to use for reading. */
48 input_phi (struct lto_input_block
*ib
, basic_block bb
, struct data_in
*data_in
,
51 unsigned HOST_WIDE_INT ix
;
56 ix
= streamer_read_uhwi (ib
);
57 phi_result
= (*SSANAMES (fn
))[ix
];
58 len
= EDGE_COUNT (bb
->preds
);
59 result
= create_phi_node (phi_result
, bb
);
61 /* We have to go through a lookup process here because the preds in the
62 reconstructed graph are generally in a different order than they
63 were in the original program. */
64 for (i
= 0; i
< len
; i
++)
66 tree def
= stream_read_tree (ib
, data_in
);
67 int src_index
= streamer_read_uhwi (ib
);
68 bitpack_d bp
= streamer_read_bitpack (ib
);
69 location_t arg_loc
= stream_input_location (&bp
, data_in
);
70 basic_block sbb
= BASIC_BLOCK_FOR_FN (fn
, src_index
);
75 for (j
= 0; j
< len
; j
++)
76 if (EDGE_PRED (bb
, j
)->src
== sbb
)
78 e
= EDGE_PRED (bb
, j
);
82 add_phi_arg (result
, def
, e
, arg_loc
);
89 /* Read a statement with tag TAG in function FN from block IB using
90 descriptors in DATA_IN. */
93 input_gimple_stmt (struct lto_input_block
*ib
, struct data_in
*data_in
,
97 enum gimple_code code
;
98 unsigned HOST_WIDE_INT num_ops
;
103 code
= lto_tag_to_gimple_code (tag
);
105 /* Read the tuple header. */
106 bp
= streamer_read_bitpack (ib
);
107 num_ops
= bp_unpack_var_len_unsigned (&bp
);
108 stmt
= gimple_alloc (code
, num_ops
);
109 stmt
->no_warning
= bp_unpack_value (&bp
, 1);
110 if (is_gimple_assign (stmt
))
111 stmt
->nontemporal_move
= bp_unpack_value (&bp
, 1);
112 stmt
->has_volatile_ops
= bp_unpack_value (&bp
, 1);
113 has_hist
= bp_unpack_value (&bp
, 1);
114 stmt
->subcode
= bp_unpack_var_len_unsigned (&bp
);
116 /* Read location information. */
117 gimple_set_location (stmt
, stream_input_location (&bp
, data_in
));
119 /* Read lexical block reference. */
120 gimple_set_block (stmt
, stream_read_tree (ib
, data_in
));
122 /* Read in all the operands. */
126 gimple_resx_set_region (stmt
, streamer_read_hwi (ib
));
129 case GIMPLE_EH_MUST_NOT_THROW
:
130 gimple_eh_must_not_throw_set_fndecl (stmt
, stream_read_tree (ib
, data_in
));
133 case GIMPLE_EH_DISPATCH
:
134 gimple_eh_dispatch_set_region (stmt
, streamer_read_hwi (ib
));
139 /* FIXME lto. Move most of this into a new gimple_asm_set_string(). */
140 gimple_statement_asm
*asm_stmt
= as_a
<gimple_statement_asm
*> (stmt
);
142 asm_stmt
->ni
= streamer_read_uhwi (ib
);
143 asm_stmt
->no
= streamer_read_uhwi (ib
);
144 asm_stmt
->nc
= streamer_read_uhwi (ib
);
145 asm_stmt
->nl
= streamer_read_uhwi (ib
);
146 str
= streamer_read_string_cst (data_in
, ib
);
147 asm_stmt
->string
= TREE_STRING_POINTER (str
);
159 for (i
= 0; i
< num_ops
; i
++)
161 tree
*opp
, op
= stream_read_tree (ib
, data_in
);
162 gimple_set_op (stmt
, i
, op
);
166 opp
= gimple_op_ptr (stmt
, i
);
167 if (TREE_CODE (*opp
) == ADDR_EXPR
)
168 opp
= &TREE_OPERAND (*opp
, 0);
169 while (handled_component_p (*opp
))
170 opp
= &TREE_OPERAND (*opp
, 0);
171 /* At LTO output time we wrap all global decls in MEM_REFs to
172 allow seamless replacement with prevailing decls. Undo this
173 here if the prevailing decl allows for this.
174 ??? Maybe we should simply fold all stmts. */
175 if (TREE_CODE (*opp
) == MEM_REF
176 && TREE_CODE (TREE_OPERAND (*opp
, 0)) == ADDR_EXPR
177 && integer_zerop (TREE_OPERAND (*opp
, 1))
178 && (TREE_THIS_VOLATILE (*opp
)
179 == TREE_THIS_VOLATILE
180 (TREE_OPERAND (TREE_OPERAND (*opp
, 0), 0)))
181 && !TYPE_REF_CAN_ALIAS_ALL (TREE_TYPE (TREE_OPERAND (*opp
, 1)))
183 == TREE_TYPE (TREE_TYPE (TREE_OPERAND (*opp
, 1))))
185 == TREE_TYPE (TREE_OPERAND (TREE_OPERAND (*opp
, 0), 0))))
186 *opp
= TREE_OPERAND (TREE_OPERAND (*opp
, 0), 0);
188 if (gimple_call call_stmt
= dyn_cast
<gimple_call
> (stmt
))
190 if (gimple_call_internal_p (call_stmt
))
191 gimple_call_set_internal_fn
192 (call_stmt
, streamer_read_enum (ib
, internal_fn
, IFN_LAST
));
194 gimple_call_set_fntype (call_stmt
, stream_read_tree (ib
, data_in
));
202 case GIMPLE_TRANSACTION
:
203 gimple_transaction_set_label (as_a
<gimple_transaction
> (stmt
),
204 stream_read_tree (ib
, data_in
));
208 internal_error ("bytecode stream: unknown GIMPLE statement tag %s",
212 /* Update the properties of symbols, SSA names and labels associated
214 if (code
== GIMPLE_ASSIGN
|| code
== GIMPLE_CALL
)
216 tree lhs
= gimple_get_lhs (stmt
);
217 if (lhs
&& TREE_CODE (lhs
) == SSA_NAME
)
218 SSA_NAME_DEF_STMT (lhs
) = stmt
;
220 else if (code
== GIMPLE_ASM
)
222 gimple_asm asm_stmt
= as_a
<gimple_asm
> (stmt
);
225 for (i
= 0; i
< gimple_asm_noutputs (asm_stmt
); i
++)
227 tree op
= TREE_VALUE (gimple_asm_output_op (asm_stmt
, i
));
228 if (TREE_CODE (op
) == SSA_NAME
)
229 SSA_NAME_DEF_STMT (op
) = stmt
;
233 /* Reset alias information. */
234 if (code
== GIMPLE_CALL
)
235 gimple_call_reset_alias_info (as_a
<gimple_call
> (stmt
));
237 /* Mark the statement modified so its operand vectors can be filled in. */
238 gimple_set_modified (stmt
, true);
240 stream_in_histogram_value (ib
, stmt
);
246 /* Read a basic block with tag TAG from DATA_IN using input block IB.
247 FN is the function being processed. */
250 input_bb (struct lto_input_block
*ib
, enum LTO_tags tag
,
251 struct data_in
*data_in
, struct function
*fn
,
252 int count_materialization_scale
)
256 gimple_stmt_iterator bsi
;
258 /* This routine assumes that CFUN is set to FN, as it needs to call
259 basic GIMPLE routines that use CFUN. */
260 gcc_assert (cfun
== fn
);
262 index
= streamer_read_uhwi (ib
);
263 bb
= BASIC_BLOCK_FOR_FN (fn
, index
);
265 bb
->count
= apply_scale (streamer_read_gcov_count (ib
),
266 count_materialization_scale
);
267 bb
->frequency
= streamer_read_hwi (ib
);
268 bb
->flags
= streamer_read_hwi (ib
);
270 /* LTO_bb1 has statements. LTO_bb0 does not. */
274 bsi
= gsi_start_bb (bb
);
275 tag
= streamer_read_record_start (ib
);
278 gimple stmt
= input_gimple_stmt (ib
, data_in
, tag
);
279 gsi_insert_after (&bsi
, stmt
, GSI_NEW_STMT
);
281 /* After the statement, expect a 0 delimiter or the EH region
282 that the previous statement belongs to. */
283 tag
= streamer_read_record_start (ib
);
284 lto_tag_check_set (tag
, 2, LTO_eh_region
, LTO_null
);
286 if (tag
== LTO_eh_region
)
288 HOST_WIDE_INT region
= streamer_read_hwi (ib
);
289 gcc_assert (region
== (int) region
);
290 add_stmt_to_eh_lp (stmt
, region
);
293 tag
= streamer_read_record_start (ib
);
296 tag
= streamer_read_record_start (ib
);
299 input_phi (ib
, bb
, data_in
, fn
);
300 tag
= streamer_read_record_start (ib
);