]>
Commit | Line | Data |
---|---|---|
7bfefa9d | 1 | /* Write the GIMPLE representation to a file stream. |
2 | ||
fbd26352 | 3 | Copyright (C) 2009-2019 Free Software Foundation, Inc. |
7bfefa9d | 4 | Contributed by Kenneth Zadeck <zadeck@naturalbridge.com> |
5 | Re-implemented by Diego Novillo <dnovillo@google.com> | |
6 | ||
7 | This file is part of GCC. | |
8 | ||
9 | GCC is free software; you can redistribute it and/or modify it under | |
10 | the terms of the GNU General Public License as published by the Free | |
11 | Software Foundation; either version 3, or (at your option) any later | |
12 | version. | |
13 | ||
14 | GCC is distributed in the hope that it will be useful, but WITHOUT ANY | |
15 | WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
16 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
17 | for more details. | |
18 | ||
19 | You should have received a copy of the GNU General Public License | |
20 | along with GCC; see the file COPYING3. If not see | |
21 | <http://www.gnu.org/licenses/>. */ | |
22 | ||
23 | #include "config.h" | |
24 | #include "system.h" | |
25 | #include "coretypes.h" | |
9ef16211 | 26 | #include "backend.h" |
7c29e30e | 27 | #include "target.h" |
28 | #include "rtl.h" | |
7bfefa9d | 29 | #include "tree.h" |
9ef16211 | 30 | #include "gimple.h" |
7c29e30e | 31 | #include "tree-pass.h" |
9ef16211 | 32 | #include "ssa.h" |
7c29e30e | 33 | #include "gimple-streamer.h" |
9ef16211 | 34 | #include "alias.h" |
9ed99284 | 35 | #include "stor-layout.h" |
dcf1a1ec | 36 | #include "gimple-iterator.h" |
7bfefa9d | 37 | #include "except.h" |
7bfefa9d | 38 | #include "lto-symtab.h" |
1140c305 | 39 | #include "cgraph.h" |
7a569539 | 40 | #include "cfgloop.h" |
f7715905 | 41 | #include "builtins.h" |
ca4c3545 | 42 | #include "gomp-constants.h" |
7b53e714 | 43 | #include "debug.h" |
5458c829 | 44 | #include "omp-offload.h" |
7858a084 | 45 | #include "print-tree.h" |
614e788f | 46 | #include "tree-dfa.h" |
7bfefa9d | 47 | |
48 | ||
c40a5c1b | 49 | static void lto_write_tree (struct output_block*, tree, bool); |
50 | ||
7bfefa9d | 51 | /* Clear the line info stored in DATA_IN. */ |
52 | ||
53 | static void | |
54 | clear_line_info (struct output_block *ob) | |
55 | { | |
56 | ob->current_file = NULL; | |
57 | ob->current_line = 0; | |
58 | ob->current_col = 0; | |
76e62595 | 59 | ob->current_sysp = false; |
7bfefa9d | 60 | } |
61 | ||
62 | ||
63 | /* Create the output block and return it. SECTION_TYPE is | |
64 | LTO_section_function_body or LTO_static_initializer. */ | |
65 | ||
66 | struct output_block * | |
67 | create_output_block (enum lto_section_type section_type) | |
68 | { | |
69 | struct output_block *ob = XCNEW (struct output_block); | |
7858a084 | 70 | if (streamer_dump_file) |
71 | fprintf (streamer_dump_file, "Creating output block for %s\n", | |
72 | lto_section_name [section_type]); | |
7bfefa9d | 73 | |
74 | ob->section_type = section_type; | |
75 | ob->decl_state = lto_get_out_decl_state (); | |
2541503d | 76 | ob->main_stream = XCNEW (struct lto_output_stream); |
77 | ob->string_stream = XCNEW (struct lto_output_stream); | |
b1e946ea | 78 | ob->writer_cache = streamer_tree_cache_create (!flag_wpa, true, false); |
7bfefa9d | 79 | |
2541503d | 80 | if (section_type == LTO_section_function_body) |
81 | ob->cfg_stream = XCNEW (struct lto_output_stream); | |
7bfefa9d | 82 | |
2541503d | 83 | clear_line_info (ob); |
8f2eb9e1 | 84 | |
c1f445d2 | 85 | ob->string_hash_table = new hash_table<string_slot_hasher> (37); |
2541503d | 86 | gcc_obstack_init (&ob->obstack); |
7bfefa9d | 87 | |
2541503d | 88 | return ob; |
89 | } | |
7bfefa9d | 90 | |
7bfefa9d | 91 | |
2541503d | 92 | /* Destroy the output block OB. */ |
7bfefa9d | 93 | |
2541503d | 94 | void |
95 | destroy_output_block (struct output_block *ob) | |
96 | { | |
97 | enum lto_section_type section_type = ob->section_type; | |
7bfefa9d | 98 | |
c1f445d2 | 99 | delete ob->string_hash_table; |
100 | ob->string_hash_table = NULL; | |
7bfefa9d | 101 | |
2541503d | 102 | free (ob->main_stream); |
103 | free (ob->string_stream); | |
104 | if (section_type == LTO_section_function_body) | |
105 | free (ob->cfg_stream); | |
7bfefa9d | 106 | |
7f385784 | 107 | streamer_tree_cache_delete (ob->writer_cache); |
2541503d | 108 | obstack_free (&ob->obstack, NULL); |
23bdc9ca | 109 | |
2541503d | 110 | free (ob); |
7bfefa9d | 111 | } |
112 | ||
113 | ||
2541503d | 114 | /* Look up NODE in the type table and write the index for it to OB. */ |
7bfefa9d | 115 | |
116 | static void | |
2541503d | 117 | output_type_ref (struct output_block *ob, tree node) |
7bfefa9d | 118 | { |
7f385784 | 119 | streamer_write_record_start (ob, LTO_type_ref); |
2541503d | 120 | lto_output_type_ref_index (ob->decl_state, ob->main_stream, node); |
7bfefa9d | 121 | } |
122 | ||
5a824d9d | 123 | /* Wrapper around variably_modified_type_p avoiding type modification |
124 | during WPA streaming. */ | |
125 | ||
126 | static bool | |
127 | lto_variably_modified_type_p (tree type) | |
128 | { | |
129 | return (in_lto_p | |
130 | ? TYPE_LANG_FLAG_0 (TYPE_MAIN_VARIANT (type)) | |
131 | : variably_modified_type_p (type, NULL_TREE)); | |
132 | } | |
133 | ||
7bfefa9d | 134 | |
2541503d | 135 | /* Return true if tree node T is written to various tables. For these |
136 | nodes, we sometimes want to write their phyiscal representation | |
137 | (via lto_output_tree), and sometimes we need to emit an index | |
138 | reference into a table (via lto_output_tree_ref). */ | |
7bfefa9d | 139 | |
2541503d | 140 | static bool |
141 | tree_is_indexable (tree t) | |
7bfefa9d | 142 | { |
4befb9f4 | 143 | /* Parameters and return values of functions of variably modified types |
144 | must go to global stream, because they may be used in the type | |
145 | definition. */ | |
f570604f | 146 | if ((TREE_CODE (t) == PARM_DECL || TREE_CODE (t) == RESULT_DECL) |
147 | && DECL_CONTEXT (t)) | |
5a824d9d | 148 | return lto_variably_modified_type_p (TREE_TYPE (DECL_CONTEXT (t))); |
4f742e59 | 149 | /* IMPORTED_DECL is put into BLOCK and thus it never can be shared. |
150 | We should no longer need to stream it. */ | |
eac60078 | 151 | else if (TREE_CODE (t) == IMPORTED_DECL) |
4f742e59 | 152 | gcc_unreachable (); |
153 | else if (TREE_CODE (t) == LABEL_DECL) | |
154 | return FORCED_LABEL (t) || DECL_NONLOCAL (t); | |
53e9c5c4 | 155 | else if (((VAR_P (t) && !TREE_STATIC (t)) |
bad660e9 | 156 | || TREE_CODE (t) == TYPE_DECL |
6541e9a1 | 157 | || TREE_CODE (t) == CONST_DECL |
158 | || TREE_CODE (t) == NAMELIST_DECL) | |
bad660e9 | 159 | && decl_function_context (t)) |
2541503d | 160 | return false; |
8ceff600 | 161 | else if (TREE_CODE (t) == DEBUG_EXPR_DECL) |
162 | return false; | |
daa9f80e | 163 | /* Variably modified types need to be streamed alongside function |
164 | bodies because they can refer to local entities. Together with | |
165 | them we have to localize their members as well. | |
166 | ??? In theory that includes non-FIELD_DECLs as well. */ | |
167 | else if (TYPE_P (t) | |
5a824d9d | 168 | && lto_variably_modified_type_p (t)) |
daa9f80e | 169 | return false; |
170 | else if (TREE_CODE (t) == FIELD_DECL | |
5a824d9d | 171 | && lto_variably_modified_type_p (DECL_CONTEXT (t))) |
daa9f80e | 172 | return false; |
7bfefa9d | 173 | else |
2541503d | 174 | return (TYPE_P (t) || DECL_P (t) || TREE_CODE (t) == SSA_NAME); |
7bfefa9d | 175 | } |
176 | ||
177 | ||
2541503d | 178 | /* Output info about new location into bitpack BP. |
179 | After outputting bitpack, lto_output_location_data has | |
180 | to be done to output actual data. */ | |
7bfefa9d | 181 | |
ec180527 | 182 | void |
183 | lto_output_location (struct output_block *ob, struct bitpack_d *bp, | |
184 | location_t loc) | |
7bfefa9d | 185 | { |
2541503d | 186 | expanded_location xloc; |
7bfefa9d | 187 | |
5169661d | 188 | loc = LOCATION_LOCUS (loc); |
43f418e7 | 189 | bp_pack_int_in_range (bp, 0, RESERVED_LOCATION_COUNT, |
190 | loc < RESERVED_LOCATION_COUNT | |
191 | ? loc : RESERVED_LOCATION_COUNT); | |
192 | if (loc < RESERVED_LOCATION_COUNT) | |
2541503d | 193 | return; |
7bfefa9d | 194 | |
2541503d | 195 | xloc = expand_location (loc); |
7bfefa9d | 196 | |
2541503d | 197 | bp_pack_value (bp, ob->current_file != xloc.file, 1); |
ab3c0986 | 198 | bp_pack_value (bp, ob->current_line != xloc.line, 1); |
199 | bp_pack_value (bp, ob->current_col != xloc.column, 1); | |
200 | ||
2541503d | 201 | if (ob->current_file != xloc.file) |
ac07ea08 | 202 | { |
203 | bp_pack_string (ob, bp, xloc.file, true); | |
204 | bp_pack_value (bp, xloc.sysp, 1); | |
205 | } | |
2541503d | 206 | ob->current_file = xloc.file; |
ac07ea08 | 207 | ob->current_sysp = xloc.sysp; |
7bfefa9d | 208 | |
2541503d | 209 | if (ob->current_line != xloc.line) |
210 | bp_pack_var_len_unsigned (bp, xloc.line); | |
211 | ob->current_line = xloc.line; | |
a0605d65 | 212 | |
2541503d | 213 | if (ob->current_col != xloc.column) |
214 | bp_pack_var_len_unsigned (bp, xloc.column); | |
215 | ob->current_col = xloc.column; | |
7bfefa9d | 216 | } |
217 | ||
218 | ||
2541503d | 219 | /* If EXPR is an indexable tree node, output a reference to it to |
220 | output block OB. Otherwise, output the physical representation of | |
221 | EXPR to OB. */ | |
7bfefa9d | 222 | |
515cf651 | 223 | static void |
2541503d | 224 | lto_output_tree_ref (struct output_block *ob, tree expr) |
7bfefa9d | 225 | { |
2541503d | 226 | enum tree_code code; |
7bfefa9d | 227 | |
2541503d | 228 | if (TYPE_P (expr)) |
7bfefa9d | 229 | { |
2541503d | 230 | output_type_ref (ob, expr); |
231 | return; | |
7bfefa9d | 232 | } |
2541503d | 233 | |
234 | code = TREE_CODE (expr); | |
235 | switch (code) | |
7bfefa9d | 236 | { |
2541503d | 237 | case SSA_NAME: |
7f385784 | 238 | streamer_write_record_start (ob, LTO_ssa_name_ref); |
239 | streamer_write_uhwi (ob, SSA_NAME_VERSION (expr)); | |
2541503d | 240 | break; |
241 | ||
242 | case FIELD_DECL: | |
7f385784 | 243 | streamer_write_record_start (ob, LTO_field_decl_ref); |
2541503d | 244 | lto_output_field_decl_index (ob->decl_state, ob->main_stream, expr); |
245 | break; | |
246 | ||
247 | case FUNCTION_DECL: | |
7f385784 | 248 | streamer_write_record_start (ob, LTO_function_decl_ref); |
2541503d | 249 | lto_output_fn_decl_index (ob->decl_state, ob->main_stream, expr); |
250 | break; | |
251 | ||
252 | case VAR_DECL: | |
253 | case DEBUG_EXPR_DECL: | |
515cf651 | 254 | gcc_assert (decl_function_context (expr) == NULL || TREE_STATIC (expr)); |
e3533433 | 255 | /* FALLTHRU */ |
a83ad0e2 | 256 | case PARM_DECL: |
7f385784 | 257 | streamer_write_record_start (ob, LTO_global_decl_ref); |
2541503d | 258 | lto_output_var_decl_index (ob->decl_state, ob->main_stream, expr); |
259 | break; | |
260 | ||
261 | case CONST_DECL: | |
7f385784 | 262 | streamer_write_record_start (ob, LTO_const_decl_ref); |
2541503d | 263 | lto_output_var_decl_index (ob->decl_state, ob->main_stream, expr); |
264 | break; | |
265 | ||
266 | case IMPORTED_DECL: | |
267 | gcc_assert (decl_function_context (expr) == NULL); | |
7f385784 | 268 | streamer_write_record_start (ob, LTO_imported_decl_ref); |
2541503d | 269 | lto_output_var_decl_index (ob->decl_state, ob->main_stream, expr); |
270 | break; | |
271 | ||
272 | case TYPE_DECL: | |
7f385784 | 273 | streamer_write_record_start (ob, LTO_type_decl_ref); |
2541503d | 274 | lto_output_type_decl_index (ob->decl_state, ob->main_stream, expr); |
275 | break; | |
276 | ||
c40a5c1b | 277 | case NAMELIST_DECL: |
6541e9a1 | 278 | streamer_write_record_start (ob, LTO_namelist_decl_ref); |
279 | lto_output_var_decl_index (ob->decl_state, ob->main_stream, expr); | |
280 | break; | |
c40a5c1b | 281 | |
2541503d | 282 | case NAMESPACE_DECL: |
7f385784 | 283 | streamer_write_record_start (ob, LTO_namespace_decl_ref); |
2541503d | 284 | lto_output_namespace_decl_index (ob->decl_state, ob->main_stream, expr); |
285 | break; | |
286 | ||
287 | case LABEL_DECL: | |
7f385784 | 288 | streamer_write_record_start (ob, LTO_label_decl_ref); |
2541503d | 289 | lto_output_var_decl_index (ob->decl_state, ob->main_stream, expr); |
290 | break; | |
291 | ||
292 | case RESULT_DECL: | |
7f385784 | 293 | streamer_write_record_start (ob, LTO_result_decl_ref); |
2541503d | 294 | lto_output_var_decl_index (ob->decl_state, ob->main_stream, expr); |
295 | break; | |
296 | ||
297 | case TRANSLATION_UNIT_DECL: | |
7f385784 | 298 | streamer_write_record_start (ob, LTO_translation_unit_decl_ref); |
2541503d | 299 | lto_output_var_decl_index (ob->decl_state, ob->main_stream, expr); |
300 | break; | |
301 | ||
302 | default: | |
515cf651 | 303 | /* No other node is indexable, so it should have been handled by |
304 | lto_output_tree. */ | |
305 | gcc_unreachable (); | |
306 | } | |
307 | } | |
308 | ||
309 | ||
310 | /* Return true if EXPR is a tree node that can be written to disk. */ | |
311 | ||
312 | static inline bool | |
313 | lto_is_streamable (tree expr) | |
314 | { | |
315 | enum tree_code code = TREE_CODE (expr); | |
316 | ||
317 | /* Notice that we reject SSA_NAMEs as well. We only emit the SSA | |
318 | name version in lto_output_tree_ref (see output_ssa_names). */ | |
319 | return !is_lang_specific (expr) | |
320 | && code != SSA_NAME | |
515cf651 | 321 | && code != LANG_TYPE |
322 | && code != MODIFY_EXPR | |
323 | && code != INIT_EXPR | |
324 | && code != TARGET_EXPR | |
325 | && code != BIND_EXPR | |
326 | && code != WITH_CLEANUP_EXPR | |
327 | && code != STATEMENT_LIST | |
515cf651 | 328 | && (code == CASE_LABEL_EXPR |
329 | || code == DECL_EXPR | |
330 | || TREE_CODE_CLASS (code) != tcc_statement); | |
331 | } | |
332 | ||
8f1b9636 | 333 | /* Very rough estimate of streaming size of the initializer. If we ignored |
334 | presence of strings, we could simply just count number of non-indexable | |
335 | tree nodes and number of references to indexable nodes. Strings however | |
336 | may be very large and we do not want to dump them int othe global stream. | |
337 | ||
338 | Count the size of initializer until the size in DATA is positive. */ | |
339 | ||
340 | static tree | |
341 | subtract_estimated_size (tree *tp, int *ws, void *data) | |
342 | { | |
343 | long *sum = (long *)data; | |
344 | if (tree_is_indexable (*tp)) | |
345 | { | |
346 | /* Indexable tree is one reference to global stream. | |
347 | Guess it may be about 4 bytes. */ | |
348 | *sum -= 4; | |
349 | *ws = 0; | |
350 | } | |
351 | /* String table entry + base of tree node needs to be streamed. */ | |
352 | if (TREE_CODE (*tp) == STRING_CST) | |
353 | *sum -= TREE_STRING_LENGTH (*tp) + 8; | |
354 | else | |
355 | { | |
356 | /* Identifiers are also variable length but should not appear | |
357 | naked in constructor. */ | |
358 | gcc_checking_assert (TREE_CODE (*tp) != IDENTIFIER_NODE); | |
359 | /* We do not really make attempt to work out size of pickled tree, as | |
360 | it is very variable. Make it bigger than the reference. */ | |
361 | *sum -= 16; | |
362 | } | |
363 | if (*sum < 0) | |
364 | return *tp; | |
365 | return NULL_TREE; | |
366 | } | |
367 | ||
515cf651 | 368 | |
8ceff600 | 369 | /* For EXPR lookup and return what we want to stream to OB as DECL_INITIAL. */ |
370 | ||
371 | static tree | |
afb0d513 | 372 | get_symbol_initial_value (lto_symtab_encoder_t encoder, tree expr) |
8ceff600 | 373 | { |
374 | gcc_checking_assert (DECL_P (expr) | |
375 | && TREE_CODE (expr) != FUNCTION_DECL | |
376 | && TREE_CODE (expr) != TRANSLATION_UNIT_DECL); | |
377 | ||
378 | /* Handle DECL_INITIAL for symbols. */ | |
379 | tree initial = DECL_INITIAL (expr); | |
53e9c5c4 | 380 | if (VAR_P (expr) |
8ceff600 | 381 | && (TREE_STATIC (expr) || DECL_EXTERNAL (expr)) |
382 | && !DECL_IN_CONSTANT_POOL (expr) | |
383 | && initial) | |
384 | { | |
098f44bc | 385 | varpool_node *vnode; |
afb0d513 | 386 | /* Extra section needs about 30 bytes; do not produce it for simple |
387 | scalar values. */ | |
8f1b9636 | 388 | if (!(vnode = varpool_node::get (expr)) |
afb0d513 | 389 | || !lto_symtab_encoder_encode_initializer_p (encoder, vnode)) |
390 | initial = error_mark_node; | |
8f1b9636 | 391 | if (initial != error_mark_node) |
392 | { | |
393 | long max_size = 30; | |
394 | if (walk_tree (&initial, subtract_estimated_size, (void *)&max_size, | |
395 | NULL)) | |
396 | initial = error_mark_node; | |
397 | } | |
8ceff600 | 398 | } |
399 | ||
400 | return initial; | |
401 | } | |
402 | ||
403 | ||
515cf651 | 404 | /* Write a physical representation of tree node EXPR to output block |
405 | OB. If REF_P is true, the leaves of EXPR are emitted as references | |
406 | via lto_output_tree_ref. IX is the index into the streamer cache | |
407 | where EXPR is stored. */ | |
408 | ||
409 | static void | |
8ceff600 | 410 | lto_write_tree_1 (struct output_block *ob, tree expr, bool ref_p) |
515cf651 | 411 | { |
515cf651 | 412 | /* Pack all the non-pointer fields in EXPR into a bitpack and write |
413 | the resulting bitpack. */ | |
c76dc468 | 414 | streamer_write_tree_bitfields (ob, expr); |
515cf651 | 415 | |
416 | /* Write all the pointer fields in EXPR. */ | |
7f385784 | 417 | streamer_write_tree_body (ob, expr, ref_p); |
515cf651 | 418 | |
419 | /* Write any LTO-specific data to OB. */ | |
420 | if (DECL_P (expr) | |
421 | && TREE_CODE (expr) != FUNCTION_DECL | |
422 | && TREE_CODE (expr) != TRANSLATION_UNIT_DECL) | |
423 | { | |
424 | /* Handle DECL_INITIAL for symbols. */ | |
afb0d513 | 425 | tree initial = get_symbol_initial_value |
426 | (ob->decl_state->symtab_node_encoder, expr); | |
515cf651 | 427 | stream_write_tree (ob, initial, ref_p); |
428 | } | |
7b53e714 | 429 | |
430 | /* Stream references to early generated DIEs. Keep in sync with the | |
431 | trees handled in dwarf2out_die_ref_for_decl. */ | |
432 | if ((DECL_P (expr) | |
433 | && TREE_CODE (expr) != FIELD_DECL | |
434 | && TREE_CODE (expr) != DEBUG_EXPR_DECL | |
435 | && TREE_CODE (expr) != TYPE_DECL) | |
436 | || TREE_CODE (expr) == BLOCK) | |
437 | { | |
438 | const char *sym; | |
439 | unsigned HOST_WIDE_INT off; | |
440 | if (debug_info_level > DINFO_LEVEL_NONE | |
441 | && debug_hooks->die_ref_for_decl (expr, &sym, &off)) | |
442 | { | |
443 | streamer_write_string (ob, ob->main_stream, sym, true); | |
444 | streamer_write_uhwi (ob, off); | |
445 | } | |
446 | else | |
447 | streamer_write_string (ob, ob->main_stream, NULL, true); | |
448 | } | |
8ceff600 | 449 | } |
450 | ||
451 | /* Write a physical representation of tree node EXPR to output block | |
452 | OB. If REF_P is true, the leaves of EXPR are emitted as references | |
453 | via lto_output_tree_ref. IX is the index into the streamer cache | |
454 | where EXPR is stored. */ | |
455 | ||
456 | static void | |
457 | lto_write_tree (struct output_block *ob, tree expr, bool ref_p) | |
458 | { | |
459 | if (!lto_is_streamable (expr)) | |
460 | internal_error ("tree code %qs is not supported in LTO streams", | |
f3d35d4d | 461 | get_tree_code_name (TREE_CODE (expr))); |
8ceff600 | 462 | |
463 | /* Write the header, containing everything needed to materialize | |
464 | EXPR on the reading side. */ | |
465 | streamer_write_tree_header (ob, expr); | |
466 | ||
467 | lto_write_tree_1 (ob, expr, ref_p); | |
515cf651 | 468 | |
469 | /* Mark the end of EXPR. */ | |
7f385784 | 470 | streamer_write_zero (ob); |
515cf651 | 471 | } |
472 | ||
11e0a6ff | 473 | /* Emit the physical representation of tree node EXPR to output block OB, |
474 | If THIS_REF_P is true, the leaves of EXPR are emitted as references via | |
475 | lto_output_tree_ref. REF_P is used for streaming siblings of EXPR. */ | |
8ceff600 | 476 | |
477 | static void | |
478 | lto_output_tree_1 (struct output_block *ob, tree expr, hashval_t hash, | |
479 | bool ref_p, bool this_ref_p) | |
480 | { | |
481 | unsigned ix; | |
482 | ||
483 | gcc_checking_assert (expr != NULL_TREE | |
484 | && !(this_ref_p && tree_is_indexable (expr))); | |
485 | ||
486 | bool exists_p = streamer_tree_cache_insert (ob->writer_cache, | |
487 | expr, hash, &ix); | |
488 | gcc_assert (!exists_p); | |
c0250021 | 489 | if (TREE_CODE (expr) == INTEGER_CST |
490 | && !TREE_OVERFLOW (expr)) | |
8ceff600 | 491 | { |
492 | /* Shared INTEGER_CST nodes are special because they need their | |
493 | original type to be materialized by the reader (to implement | |
494 | TYPE_CACHED_VALUES). */ | |
495 | streamer_write_integer_cst (ob, expr, ref_p); | |
496 | } | |
497 | else | |
498 | { | |
499 | /* This is the first time we see EXPR, write its fields | |
500 | to OB. */ | |
501 | lto_write_tree (ob, expr, ref_p); | |
502 | } | |
503 | } | |
504 | ||
9e057653 | 505 | class DFS |
8ceff600 | 506 | { |
9e057653 | 507 | public: |
508 | DFS (struct output_block *ob, tree expr, bool ref_p, bool this_ref_p, | |
509 | bool single_p); | |
510 | ~DFS (); | |
511 | ||
512 | struct scc_entry | |
513 | { | |
514 | tree t; | |
515 | hashval_t hash; | |
516 | }; | |
517 | vec<scc_entry> sccstack; | |
518 | ||
519 | private: | |
520 | struct sccs | |
521 | { | |
522 | unsigned int dfsnum; | |
523 | unsigned int low; | |
524 | }; | |
35fafcb2 | 525 | struct worklist |
526 | { | |
527 | tree expr; | |
528 | sccs *from_state; | |
529 | sccs *cstate; | |
530 | bool ref_p; | |
531 | bool this_ref_p; | |
532 | }; | |
9e057653 | 533 | |
534 | static int scc_entry_compare (const void *, const void *); | |
535 | ||
536 | void DFS_write_tree_body (struct output_block *ob, | |
35fafcb2 | 537 | tree expr, sccs *expr_state, bool ref_p); |
9e057653 | 538 | |
539 | void DFS_write_tree (struct output_block *ob, sccs *from_state, | |
35fafcb2 | 540 | tree expr, bool ref_p, bool this_ref_p); |
541 | ||
9e057653 | 542 | hashval_t |
11e0a6ff | 543 | hash_scc (struct output_block *ob, unsigned first, unsigned size, |
544 | bool ref_p, bool this_ref_p); | |
9e057653 | 545 | |
5f8841a5 | 546 | hash_map<tree, sccs *> sccstate; |
35fafcb2 | 547 | vec<worklist> worklist_vec; |
9e057653 | 548 | struct obstack sccstate_obstack; |
8ceff600 | 549 | }; |
550 | ||
11e0a6ff | 551 | /* Emit the physical representation of tree node EXPR to output block OB, |
552 | using depth-first search on the subgraph. If THIS_REF_P is true, the | |
553 | leaves of EXPR are emitted as references via lto_output_tree_ref. | |
554 | REF_P is used for streaming siblings of EXPR. If SINGLE_P is true, | |
555 | this is for a rewalk of a single leaf SCC. */ | |
556 | ||
9e057653 | 557 | DFS::DFS (struct output_block *ob, tree expr, bool ref_p, bool this_ref_p, |
558 | bool single_p) | |
8ceff600 | 559 | { |
35fafcb2 | 560 | unsigned int next_dfs_num = 1; |
9e057653 | 561 | sccstack.create (0); |
9e057653 | 562 | gcc_obstack_init (&sccstate_obstack); |
35fafcb2 | 563 | worklist_vec = vNULL; |
564 | DFS_write_tree (ob, NULL, expr, ref_p, this_ref_p); | |
565 | while (!worklist_vec.is_empty ()) | |
566 | { | |
567 | worklist &w = worklist_vec.last (); | |
568 | expr = w.expr; | |
569 | sccs *from_state = w.from_state; | |
570 | sccs *cstate = w.cstate; | |
571 | ref_p = w.ref_p; | |
572 | this_ref_p = w.this_ref_p; | |
573 | if (cstate == NULL) | |
574 | { | |
575 | sccs **slot = &sccstate.get_or_insert (expr); | |
576 | cstate = *slot; | |
577 | if (cstate) | |
578 | { | |
579 | gcc_checking_assert (from_state); | |
580 | if (cstate->dfsnum < from_state->dfsnum) | |
581 | from_state->low = MIN (cstate->dfsnum, from_state->low); | |
582 | worklist_vec.pop (); | |
583 | continue; | |
584 | } | |
585 | ||
586 | scc_entry e = { expr, 0 }; | |
587 | /* Not yet visited. DFS recurse and push it onto the stack. */ | |
588 | *slot = cstate = XOBNEW (&sccstate_obstack, struct sccs); | |
589 | sccstack.safe_push (e); | |
590 | cstate->dfsnum = next_dfs_num++; | |
591 | cstate->low = cstate->dfsnum; | |
592 | w.cstate = cstate; | |
593 | ||
c0250021 | 594 | if (TREE_CODE (expr) == INTEGER_CST |
595 | && !TREE_OVERFLOW (expr)) | |
35fafcb2 | 596 | DFS_write_tree (ob, cstate, TREE_TYPE (expr), ref_p, ref_p); |
597 | else | |
598 | { | |
599 | DFS_write_tree_body (ob, expr, cstate, ref_p); | |
600 | ||
601 | /* Walk any LTO-specific edges. */ | |
602 | if (DECL_P (expr) | |
603 | && TREE_CODE (expr) != FUNCTION_DECL | |
604 | && TREE_CODE (expr) != TRANSLATION_UNIT_DECL) | |
605 | { | |
606 | /* Handle DECL_INITIAL for symbols. */ | |
607 | tree initial | |
608 | = get_symbol_initial_value (ob->decl_state->symtab_node_encoder, | |
609 | expr); | |
610 | DFS_write_tree (ob, cstate, initial, ref_p, ref_p); | |
611 | } | |
612 | } | |
613 | continue; | |
614 | } | |
615 | ||
616 | /* See if we found an SCC. */ | |
617 | if (cstate->low == cstate->dfsnum) | |
618 | { | |
619 | unsigned first, size; | |
620 | tree x; | |
621 | ||
11e0a6ff | 622 | /* If we are re-walking a single leaf SCC just pop it, |
35fafcb2 | 623 | let earlier worklist item access the sccstack. */ |
624 | if (single_p) | |
625 | { | |
626 | worklist_vec.pop (); | |
627 | continue; | |
628 | } | |
629 | ||
630 | /* Pop the SCC and compute its size. */ | |
631 | first = sccstack.length (); | |
632 | do | |
633 | { | |
634 | x = sccstack[--first].t; | |
635 | } | |
636 | while (x != expr); | |
637 | size = sccstack.length () - first; | |
638 | ||
639 | /* No need to compute hashes for LTRANS units, we don't perform | |
640 | any merging there. */ | |
641 | hashval_t scc_hash = 0; | |
642 | unsigned scc_entry_len = 0; | |
643 | if (!flag_wpa) | |
644 | { | |
11e0a6ff | 645 | scc_hash = hash_scc (ob, first, size, ref_p, this_ref_p); |
35fafcb2 | 646 | |
647 | /* Put the entries with the least number of collisions first. */ | |
648 | unsigned entry_start = 0; | |
649 | scc_entry_len = size + 1; | |
650 | for (unsigned i = 0; i < size;) | |
651 | { | |
652 | unsigned from = i; | |
653 | for (i = i + 1; i < size | |
654 | && (sccstack[first + i].hash | |
655 | == sccstack[first + from].hash); ++i) | |
656 | ; | |
657 | if (i - from < scc_entry_len) | |
658 | { | |
659 | scc_entry_len = i - from; | |
660 | entry_start = from; | |
661 | } | |
662 | } | |
663 | for (unsigned i = 0; i < scc_entry_len; ++i) | |
a4f59596 | 664 | std::swap (sccstack[first + i], |
665 | sccstack[first + entry_start + i]); | |
35fafcb2 | 666 | |
382ecba7 | 667 | /* We already sorted SCC deterministically in hash_scc. */ |
668 | ||
669 | /* Check that we have only one SCC. | |
670 | Naturally we may have conflicts if hash function is not | |
671 | strong enough. Lets see how far this gets. */ | |
672 | gcc_checking_assert (scc_entry_len == 1); | |
35fafcb2 | 673 | } |
674 | ||
675 | /* Write LTO_tree_scc. */ | |
676 | streamer_write_record_start (ob, LTO_tree_scc); | |
677 | streamer_write_uhwi (ob, size); | |
678 | streamer_write_uhwi (ob, scc_hash); | |
679 | ||
680 | /* Write size-1 SCCs without wrapping them inside SCC bundles. | |
681 | All INTEGER_CSTs need to be handled this way as we need | |
682 | their type to materialize them. Also builtins are handled | |
683 | this way. | |
684 | ??? We still wrap these in LTO_tree_scc so at the | |
685 | input side we can properly identify the tree we want | |
686 | to ultimatively return. */ | |
687 | if (size == 1) | |
688 | lto_output_tree_1 (ob, expr, scc_hash, ref_p, this_ref_p); | |
689 | else | |
690 | { | |
691 | /* Write the size of the SCC entry candidates. */ | |
692 | streamer_write_uhwi (ob, scc_entry_len); | |
693 | ||
694 | /* Write all headers and populate the streamer cache. */ | |
695 | for (unsigned i = 0; i < size; ++i) | |
696 | { | |
697 | hashval_t hash = sccstack[first+i].hash; | |
698 | tree t = sccstack[first+i].t; | |
699 | bool exists_p = streamer_tree_cache_insert (ob->writer_cache, | |
700 | t, hash, NULL); | |
701 | gcc_assert (!exists_p); | |
702 | ||
703 | if (!lto_is_streamable (t)) | |
704 | internal_error ("tree code %qs is not supported " | |
705 | "in LTO streams", | |
706 | get_tree_code_name (TREE_CODE (t))); | |
707 | ||
35fafcb2 | 708 | /* Write the header, containing everything needed to |
709 | materialize EXPR on the reading side. */ | |
710 | streamer_write_tree_header (ob, t); | |
711 | } | |
712 | ||
713 | /* Write the bitpacks and tree references. */ | |
714 | for (unsigned i = 0; i < size; ++i) | |
715 | { | |
716 | lto_write_tree_1 (ob, sccstack[first+i].t, ref_p); | |
717 | ||
718 | /* Mark the end of the tree. */ | |
719 | streamer_write_zero (ob); | |
720 | } | |
721 | } | |
722 | ||
723 | /* Finally truncate the vector. */ | |
724 | sccstack.truncate (first); | |
725 | ||
726 | if (from_state) | |
727 | from_state->low = MIN (from_state->low, cstate->low); | |
728 | worklist_vec.pop (); | |
729 | continue; | |
730 | } | |
731 | ||
732 | gcc_checking_assert (from_state); | |
733 | from_state->low = MIN (from_state->low, cstate->low); | |
734 | if (cstate->dfsnum < from_state->dfsnum) | |
735 | from_state->low = MIN (cstate->dfsnum, from_state->low); | |
736 | worklist_vec.pop (); | |
737 | } | |
738 | worklist_vec.release (); | |
9e057653 | 739 | } |
8ceff600 | 740 | |
9e057653 | 741 | DFS::~DFS () |
742 | { | |
743 | sccstack.release (); | |
9e057653 | 744 | obstack_free (&sccstate_obstack, NULL); |
745 | } | |
8ceff600 | 746 | |
747 | /* Handle the tree EXPR in the DFS walk with SCC state EXPR_STATE and | |
748 | DFS recurse for all tree edges originating from it. */ | |
749 | ||
9e057653 | 750 | void |
751 | DFS::DFS_write_tree_body (struct output_block *ob, | |
35fafcb2 | 752 | tree expr, sccs *expr_state, bool ref_p) |
8ceff600 | 753 | { |
754 | #define DFS_follow_tree_edge(DEST) \ | |
35fafcb2 | 755 | DFS_write_tree (ob, expr_state, DEST, ref_p, ref_p) |
8ceff600 | 756 | |
757 | enum tree_code code; | |
758 | ||
7858a084 | 759 | if (streamer_dump_file) |
760 | { | |
761 | print_node_brief (streamer_dump_file, " Streaming ", | |
762 | expr, 4); | |
763 | fprintf (streamer_dump_file, " to %s\n", | |
764 | lto_section_name [ob->section_type]); | |
765 | } | |
766 | ||
8ceff600 | 767 | code = TREE_CODE (expr); |
768 | ||
769 | if (CODE_CONTAINS_STRUCT (code, TS_TYPED)) | |
770 | { | |
771 | if (TREE_CODE (expr) != IDENTIFIER_NODE) | |
772 | DFS_follow_tree_edge (TREE_TYPE (expr)); | |
773 | } | |
774 | ||
775 | if (CODE_CONTAINS_STRUCT (code, TS_VECTOR)) | |
776 | { | |
998afe5d | 777 | unsigned int count = vector_cst_encoded_nelts (expr); |
778 | for (unsigned int i = 0; i < count; ++i) | |
779 | DFS_follow_tree_edge (VECTOR_CST_ENCODED_ELT (expr, i)); | |
8ceff600 | 780 | } |
781 | ||
8672ee56 | 782 | if (CODE_CONTAINS_STRUCT (code, TS_POLY_INT_CST)) |
783 | for (unsigned int i = 0; i < NUM_POLY_INT_COEFFS; ++i) | |
784 | DFS_follow_tree_edge (POLY_INT_CST_COEFF (expr, i)); | |
785 | ||
8ceff600 | 786 | if (CODE_CONTAINS_STRUCT (code, TS_COMPLEX)) |
787 | { | |
788 | DFS_follow_tree_edge (TREE_REALPART (expr)); | |
789 | DFS_follow_tree_edge (TREE_IMAGPART (expr)); | |
790 | } | |
791 | ||
792 | if (CODE_CONTAINS_STRUCT (code, TS_DECL_MINIMAL)) | |
793 | { | |
794 | /* Drop names that were created for anonymous entities. */ | |
795 | if (DECL_NAME (expr) | |
796 | && TREE_CODE (DECL_NAME (expr)) == IDENTIFIER_NODE | |
b95089a0 | 797 | && IDENTIFIER_ANON_P (DECL_NAME (expr))) |
8ceff600 | 798 | ; |
799 | else | |
800 | DFS_follow_tree_edge (DECL_NAME (expr)); | |
7b53e714 | 801 | if (TREE_CODE (expr) != TRANSLATION_UNIT_DECL |
802 | && ! DECL_CONTEXT (expr)) | |
803 | DFS_follow_tree_edge ((*all_translation_units)[0]); | |
804 | else | |
805 | DFS_follow_tree_edge (DECL_CONTEXT (expr)); | |
8ceff600 | 806 | } |
807 | ||
808 | if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON)) | |
809 | { | |
810 | DFS_follow_tree_edge (DECL_SIZE (expr)); | |
811 | DFS_follow_tree_edge (DECL_SIZE_UNIT (expr)); | |
812 | ||
813 | /* Note, DECL_INITIAL is not handled here. Since DECL_INITIAL needs | |
814 | special handling in LTO, it must be handled by streamer hooks. */ | |
815 | ||
816 | DFS_follow_tree_edge (DECL_ATTRIBUTES (expr)); | |
817 | ||
66532ac2 | 818 | /* We use DECL_ABSTRACT_ORIGIN == error_mark_node to mark |
4e42d239 | 819 | declarations which should be eliminated by decl merging. Be sure none |
820 | leaks to this point. */ | |
821 | gcc_assert (DECL_ABSTRACT_ORIGIN (expr) != error_mark_node); | |
7b53e714 | 822 | DFS_follow_tree_edge (DECL_ABSTRACT_ORIGIN (expr)); |
8ceff600 | 823 | |
53e9c5c4 | 824 | if ((VAR_P (expr) |
8ceff600 | 825 | || TREE_CODE (expr) == PARM_DECL) |
826 | && DECL_HAS_VALUE_EXPR_P (expr)) | |
827 | DFS_follow_tree_edge (DECL_VALUE_EXPR (expr)); | |
8ef2a99e | 828 | if (VAR_P (expr) |
829 | && DECL_HAS_DEBUG_EXPR_P (expr)) | |
8ceff600 | 830 | DFS_follow_tree_edge (DECL_DEBUG_EXPR (expr)); |
831 | } | |
832 | ||
8ceff600 | 833 | if (CODE_CONTAINS_STRUCT (code, TS_DECL_WITH_VIS)) |
834 | { | |
835 | /* Make sure we don't inadvertently set the assembler name. */ | |
836 | if (DECL_ASSEMBLER_NAME_SET_P (expr)) | |
837 | DFS_follow_tree_edge (DECL_ASSEMBLER_NAME (expr)); | |
8ceff600 | 838 | } |
839 | ||
840 | if (CODE_CONTAINS_STRUCT (code, TS_FIELD_DECL)) | |
841 | { | |
842 | DFS_follow_tree_edge (DECL_FIELD_OFFSET (expr)); | |
843 | DFS_follow_tree_edge (DECL_BIT_FIELD_TYPE (expr)); | |
844 | DFS_follow_tree_edge (DECL_BIT_FIELD_REPRESENTATIVE (expr)); | |
845 | DFS_follow_tree_edge (DECL_FIELD_BIT_OFFSET (expr)); | |
25c94423 | 846 | gcc_checking_assert (!DECL_FCONTEXT (expr)); |
8ceff600 | 847 | } |
848 | ||
849 | if (CODE_CONTAINS_STRUCT (code, TS_FUNCTION_DECL)) | |
850 | { | |
dce9669a | 851 | gcc_checking_assert (DECL_VINDEX (expr) == NULL); |
8ceff600 | 852 | DFS_follow_tree_edge (DECL_FUNCTION_PERSONALITY (expr)); |
0fd94051 | 853 | DFS_follow_tree_edge (DECL_FUNCTION_SPECIFIC_TARGET (expr)); |
8ceff600 | 854 | DFS_follow_tree_edge (DECL_FUNCTION_SPECIFIC_OPTIMIZATION (expr)); |
855 | } | |
856 | ||
857 | if (CODE_CONTAINS_STRUCT (code, TS_TYPE_COMMON)) | |
858 | { | |
859 | DFS_follow_tree_edge (TYPE_SIZE (expr)); | |
860 | DFS_follow_tree_edge (TYPE_SIZE_UNIT (expr)); | |
861 | DFS_follow_tree_edge (TYPE_ATTRIBUTES (expr)); | |
862 | DFS_follow_tree_edge (TYPE_NAME (expr)); | |
863 | /* Do not follow TYPE_POINTER_TO or TYPE_REFERENCE_TO. They will be | |
864 | reconstructed during fixup. */ | |
865 | /* Do not follow TYPE_NEXT_VARIANT, we reconstruct the variant lists | |
866 | during fixup. */ | |
867 | DFS_follow_tree_edge (TYPE_MAIN_VARIANT (expr)); | |
868 | DFS_follow_tree_edge (TYPE_CONTEXT (expr)); | |
869 | /* TYPE_CANONICAL is re-computed during type merging, so no need | |
870 | to follow it here. */ | |
abf0dec5 | 871 | /* Do not stream TYPE_STUB_DECL; it is not needed by LTO but currently |
f4d3c071 | 872 | it cannot be freed by free_lang_data without triggering ICEs in |
abf0dec5 | 873 | langhooks. */ |
8ceff600 | 874 | } |
875 | ||
876 | if (CODE_CONTAINS_STRUCT (code, TS_TYPE_NON_COMMON)) | |
877 | { | |
878 | if (TREE_CODE (expr) == ENUMERAL_TYPE) | |
879 | DFS_follow_tree_edge (TYPE_VALUES (expr)); | |
880 | else if (TREE_CODE (expr) == ARRAY_TYPE) | |
881 | DFS_follow_tree_edge (TYPE_DOMAIN (expr)); | |
882 | else if (RECORD_OR_UNION_TYPE_P (expr)) | |
883 | for (tree t = TYPE_FIELDS (expr); t; t = TREE_CHAIN (t)) | |
884 | DFS_follow_tree_edge (t); | |
885 | else if (TREE_CODE (expr) == FUNCTION_TYPE | |
886 | || TREE_CODE (expr) == METHOD_TYPE) | |
887 | DFS_follow_tree_edge (TYPE_ARG_TYPES (expr)); | |
888 | ||
889 | if (!POINTER_TYPE_P (expr)) | |
c6f56d33 | 890 | DFS_follow_tree_edge (TYPE_MIN_VALUE_RAW (expr)); |
891 | DFS_follow_tree_edge (TYPE_MAX_VALUE_RAW (expr)); | |
8ceff600 | 892 | } |
893 | ||
894 | if (CODE_CONTAINS_STRUCT (code, TS_LIST)) | |
895 | { | |
896 | DFS_follow_tree_edge (TREE_PURPOSE (expr)); | |
897 | DFS_follow_tree_edge (TREE_VALUE (expr)); | |
898 | DFS_follow_tree_edge (TREE_CHAIN (expr)); | |
899 | } | |
900 | ||
901 | if (CODE_CONTAINS_STRUCT (code, TS_VEC)) | |
902 | { | |
903 | for (int i = 0; i < TREE_VEC_LENGTH (expr); i++) | |
904 | DFS_follow_tree_edge (TREE_VEC_ELT (expr, i)); | |
905 | } | |
906 | ||
907 | if (CODE_CONTAINS_STRUCT (code, TS_EXP)) | |
908 | { | |
909 | for (int i = 0; i < TREE_OPERAND_LENGTH (expr); i++) | |
910 | DFS_follow_tree_edge (TREE_OPERAND (expr, i)); | |
911 | DFS_follow_tree_edge (TREE_BLOCK (expr)); | |
912 | } | |
913 | ||
914 | if (CODE_CONTAINS_STRUCT (code, TS_BLOCK)) | |
915 | { | |
916 | for (tree t = BLOCK_VARS (expr); t; t = TREE_CHAIN (t)) | |
253dcb05 | 917 | { |
918 | /* We would have to stream externals in the block chain as | |
919 | non-references but we should have dropped them in | |
920 | free-lang-data. */ | |
921 | gcc_assert (!VAR_OR_FUNCTION_DECL_P (t) || !DECL_EXTERNAL (t)); | |
8ceff600 | 922 | DFS_follow_tree_edge (t); |
253dcb05 | 923 | } |
8ceff600 | 924 | |
925 | DFS_follow_tree_edge (BLOCK_SUPERCONTEXT (expr)); | |
66532ac2 | 926 | DFS_follow_tree_edge (BLOCK_ABSTRACT_ORIGIN (expr)); |
8ceff600 | 927 | |
8ceff600 | 928 | /* Do not follow BLOCK_NONLOCALIZED_VARS. We cannot handle debug |
929 | information for early inlined BLOCKs so drop it on the floor instead | |
930 | of ICEing in dwarf2out.c. */ | |
931 | ||
932 | /* BLOCK_FRAGMENT_ORIGIN and BLOCK_FRAGMENT_CHAIN is not live at LTO | |
933 | streaming time. */ | |
934 | ||
935 | /* Do not output BLOCK_SUBBLOCKS. Instead on streaming-in this | |
936 | list is re-constructed from BLOCK_SUPERCONTEXT. */ | |
937 | } | |
938 | ||
939 | if (CODE_CONTAINS_STRUCT (code, TS_BINFO)) | |
940 | { | |
941 | unsigned i; | |
942 | tree t; | |
943 | ||
944 | /* Note that the number of BINFO slots has already been emitted in | |
945 | EXPR's header (see streamer_write_tree_header) because this length | |
946 | is needed to build the empty BINFO node on the reader side. */ | |
947 | FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (expr), i, t) | |
948 | DFS_follow_tree_edge (t); | |
949 | DFS_follow_tree_edge (BINFO_OFFSET (expr)); | |
950 | DFS_follow_tree_edge (BINFO_VTABLE (expr)); | |
8ceff600 | 951 | |
42e9919f | 952 | /* Do not walk BINFO_INHERITANCE_CHAIN, BINFO_SUBVTT_INDEX, |
953 | BINFO_BASE_ACCESSES and BINFO_VPTR_INDEX; these are used | |
954 | by C++ FE only. */ | |
8ceff600 | 955 | } |
956 | ||
957 | if (CODE_CONTAINS_STRUCT (code, TS_CONSTRUCTOR)) | |
958 | { | |
959 | unsigned i; | |
960 | tree index, value; | |
961 | ||
962 | FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (expr), i, index, value) | |
963 | { | |
964 | DFS_follow_tree_edge (index); | |
965 | DFS_follow_tree_edge (value); | |
966 | } | |
967 | } | |
968 | ||
fe3e3369 | 969 | if (code == OMP_CLAUSE) |
970 | { | |
971 | int i; | |
972 | for (i = 0; i < omp_clause_num_ops[OMP_CLAUSE_CODE (expr)]; i++) | |
973 | DFS_follow_tree_edge (OMP_CLAUSE_OPERAND (expr, i)); | |
974 | DFS_follow_tree_edge (OMP_CLAUSE_CHAIN (expr)); | |
975 | } | |
976 | ||
8ceff600 | 977 | #undef DFS_follow_tree_edge |
978 | } | |
979 | ||
9e057653 | 980 | /* Return a hash value for the tree T. |
981 | CACHE holds hash values of trees outside current SCC. MAP, if non-NULL, | |
982 | may hold hash values if trees inside current SCC. */ | |
8ceff600 | 983 | |
984 | static hashval_t | |
9e057653 | 985 | hash_tree (struct streamer_tree_cache_d *cache, hash_map<tree, hashval_t> *map, tree t) |
8ceff600 | 986 | { |
7fdbd1ec | 987 | inchash::hash hstate; |
9da18bc6 | 988 | |
8ceff600 | 989 | #define visit(SIBLING) \ |
990 | do { \ | |
991 | unsigned ix; \ | |
9e057653 | 992 | if (!SIBLING) \ |
993 | hstate.add_int (0); \ | |
994 | else if (streamer_tree_cache_lookup (cache, SIBLING, &ix)) \ | |
9da18bc6 | 995 | hstate.add_int (streamer_tree_cache_get_hash (cache, ix)); \ |
9e057653 | 996 | else if (map) \ |
997 | hstate.add_int (*map->get (SIBLING)); \ | |
998 | else \ | |
999 | hstate.add_int (1); \ | |
8ceff600 | 1000 | } while (0) |
1001 | ||
1002 | /* Hash TS_BASE. */ | |
1003 | enum tree_code code = TREE_CODE (t); | |
9da18bc6 | 1004 | hstate.add_int (code); |
8ceff600 | 1005 | if (!TYPE_P (t)) |
1006 | { | |
9da18bc6 | 1007 | hstate.add_flag (TREE_SIDE_EFFECTS (t)); |
1008 | hstate.add_flag (TREE_CONSTANT (t)); | |
1009 | hstate.add_flag (TREE_READONLY (t)); | |
1010 | hstate.add_flag (TREE_PUBLIC (t)); | |
8ceff600 | 1011 | } |
9da18bc6 | 1012 | hstate.add_flag (TREE_ADDRESSABLE (t)); |
1013 | hstate.add_flag (TREE_THIS_VOLATILE (t)); | |
8ceff600 | 1014 | if (DECL_P (t)) |
9da18bc6 | 1015 | hstate.add_flag (DECL_UNSIGNED (t)); |
8ceff600 | 1016 | else if (TYPE_P (t)) |
9da18bc6 | 1017 | hstate.add_flag (TYPE_UNSIGNED (t)); |
8ceff600 | 1018 | if (TYPE_P (t)) |
9da18bc6 | 1019 | hstate.add_flag (TYPE_ARTIFICIAL (t)); |
8ceff600 | 1020 | else |
9da18bc6 | 1021 | hstate.add_flag (TREE_NO_WARNING (t)); |
1022 | hstate.add_flag (TREE_NOTHROW (t)); | |
1023 | hstate.add_flag (TREE_STATIC (t)); | |
1024 | hstate.add_flag (TREE_PROTECTED (t)); | |
1025 | hstate.add_flag (TREE_DEPRECATED (t)); | |
8ceff600 | 1026 | if (code != TREE_BINFO) |
9da18bc6 | 1027 | hstate.add_flag (TREE_PRIVATE (t)); |
8ceff600 | 1028 | if (TYPE_P (t)) |
9da18bc6 | 1029 | { |
292237f3 | 1030 | hstate.add_flag (AGGREGATE_TYPE_P (t) |
1031 | ? TYPE_REVERSE_STORAGE_ORDER (t) : TYPE_SATURATING (t)); | |
9da18bc6 | 1032 | hstate.add_flag (TYPE_ADDR_SPACE (t)); |
1033 | } | |
8ceff600 | 1034 | else if (code == SSA_NAME) |
9da18bc6 | 1035 | hstate.add_flag (SSA_NAME_IS_DEFAULT_DEF (t)); |
1036 | hstate.commit_flag (); | |
8ceff600 | 1037 | |
1038 | if (CODE_CONTAINS_STRUCT (code, TS_INT_CST)) | |
ca6b9aed | 1039 | hstate.add_wide_int (wi::to_widest (t)); |
8ceff600 | 1040 | |
1041 | if (CODE_CONTAINS_STRUCT (code, TS_REAL_CST)) | |
1042 | { | |
1043 | REAL_VALUE_TYPE r = TREE_REAL_CST (t); | |
9da18bc6 | 1044 | hstate.add_flag (r.cl); |
1045 | hstate.add_flag (r.sign); | |
1046 | hstate.add_flag (r.signalling); | |
1047 | hstate.add_flag (r.canonical); | |
1048 | hstate.commit_flag (); | |
1049 | hstate.add_int (r.uexp); | |
1050 | hstate.add (r.sig, sizeof (r.sig)); | |
8ceff600 | 1051 | } |
1052 | ||
1053 | if (CODE_CONTAINS_STRUCT (code, TS_FIXED_CST)) | |
1054 | { | |
1055 | FIXED_VALUE_TYPE f = TREE_FIXED_CST (t); | |
9da18bc6 | 1056 | hstate.add_int (f.mode); |
1057 | hstate.add_int (f.data.low); | |
1058 | hstate.add_int (f.data.high); | |
8ceff600 | 1059 | } |
1060 | ||
1061 | if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON)) | |
1062 | { | |
eadcd69c | 1063 | hstate.add_hwi (DECL_MODE (t)); |
9da18bc6 | 1064 | hstate.add_flag (DECL_NONLOCAL (t)); |
1065 | hstate.add_flag (DECL_VIRTUAL_P (t)); | |
1066 | hstate.add_flag (DECL_IGNORED_P (t)); | |
16d41ae2 | 1067 | hstate.add_flag (DECL_ABSTRACT_P (t)); |
9da18bc6 | 1068 | hstate.add_flag (DECL_ARTIFICIAL (t)); |
1069 | hstate.add_flag (DECL_USER_ALIGN (t)); | |
1070 | hstate.add_flag (DECL_PRESERVE_P (t)); | |
1071 | hstate.add_flag (DECL_EXTERNAL (t)); | |
1072 | hstate.add_flag (DECL_GIMPLE_REG_P (t)); | |
1073 | hstate.commit_flag (); | |
1074 | hstate.add_int (DECL_ALIGN (t)); | |
8ceff600 | 1075 | if (code == LABEL_DECL) |
1076 | { | |
9da18bc6 | 1077 | hstate.add_int (EH_LANDING_PAD_NR (t)); |
1078 | hstate.add_int (LABEL_DECL_UID (t)); | |
8ceff600 | 1079 | } |
1080 | else if (code == FIELD_DECL) | |
1081 | { | |
9da18bc6 | 1082 | hstate.add_flag (DECL_PACKED (t)); |
1083 | hstate.add_flag (DECL_NONADDRESSABLE_P (t)); | |
532d84ff | 1084 | hstate.add_flag (DECL_PADDING_P (t)); |
9da18bc6 | 1085 | hstate.add_int (DECL_OFFSET_ALIGN (t)); |
8ceff600 | 1086 | } |
1087 | else if (code == VAR_DECL) | |
1088 | { | |
9da18bc6 | 1089 | hstate.add_flag (DECL_HAS_DEBUG_EXPR_P (t)); |
1090 | hstate.add_flag (DECL_NONLOCAL_FRAME (t)); | |
8ceff600 | 1091 | } |
1092 | if (code == RESULT_DECL | |
1093 | || code == PARM_DECL | |
1094 | || code == VAR_DECL) | |
1095 | { | |
9da18bc6 | 1096 | hstate.add_flag (DECL_BY_REFERENCE (t)); |
8ceff600 | 1097 | if (code == VAR_DECL |
1098 | || code == PARM_DECL) | |
9da18bc6 | 1099 | hstate.add_flag (DECL_HAS_VALUE_EXPR_P (t)); |
8ceff600 | 1100 | } |
9da18bc6 | 1101 | hstate.commit_flag (); |
8ceff600 | 1102 | } |
1103 | ||
1104 | if (CODE_CONTAINS_STRUCT (code, TS_DECL_WRTL)) | |
9da18bc6 | 1105 | hstate.add_int (DECL_REGISTER (t)); |
8ceff600 | 1106 | |
1107 | if (CODE_CONTAINS_STRUCT (code, TS_DECL_WITH_VIS)) | |
1108 | { | |
9da18bc6 | 1109 | hstate.add_flag (DECL_COMMON (t)); |
1110 | hstate.add_flag (DECL_DLLIMPORT_P (t)); | |
1111 | hstate.add_flag (DECL_WEAK (t)); | |
1112 | hstate.add_flag (DECL_SEEN_IN_BIND_EXPR_P (t)); | |
1113 | hstate.add_flag (DECL_COMDAT (t)); | |
1114 | hstate.add_flag (DECL_VISIBILITY_SPECIFIED (t)); | |
1115 | hstate.add_int (DECL_VISIBILITY (t)); | |
8ceff600 | 1116 | if (code == VAR_DECL) |
1117 | { | |
881fe02c | 1118 | /* DECL_IN_TEXT_SECTION is set during final asm output only. */ |
9da18bc6 | 1119 | hstate.add_flag (DECL_HARD_REGISTER (t)); |
1120 | hstate.add_flag (DECL_IN_CONSTANT_POOL (t)); | |
8ceff600 | 1121 | } |
2d9cc481 | 1122 | if (TREE_CODE (t) == FUNCTION_DECL) |
9da18bc6 | 1123 | { |
1124 | hstate.add_flag (DECL_FINAL_P (t)); | |
1125 | hstate.add_flag (DECL_CXX_CONSTRUCTOR_P (t)); | |
1126 | hstate.add_flag (DECL_CXX_DESTRUCTOR_P (t)); | |
1127 | } | |
1128 | hstate.commit_flag (); | |
8ceff600 | 1129 | } |
1130 | ||
1131 | if (CODE_CONTAINS_STRUCT (code, TS_FUNCTION_DECL)) | |
1132 | { | |
9da18bc6 | 1133 | hstate.add_int (DECL_BUILT_IN_CLASS (t)); |
1134 | hstate.add_flag (DECL_STATIC_CONSTRUCTOR (t)); | |
1135 | hstate.add_flag (DECL_STATIC_DESTRUCTOR (t)); | |
92e4277c | 1136 | hstate.add_flag (FUNCTION_DECL_DECL_TYPE (t)); |
9da18bc6 | 1137 | hstate.add_flag (DECL_UNINLINABLE (t)); |
1138 | hstate.add_flag (DECL_POSSIBLY_INLINED (t)); | |
1139 | hstate.add_flag (DECL_IS_NOVOPS (t)); | |
1140 | hstate.add_flag (DECL_IS_RETURNS_TWICE (t)); | |
1141 | hstate.add_flag (DECL_IS_MALLOC (t)); | |
9da18bc6 | 1142 | hstate.add_flag (DECL_DECLARED_INLINE_P (t)); |
1143 | hstate.add_flag (DECL_STATIC_CHAIN (t)); | |
1144 | hstate.add_flag (DECL_NO_INLINE_WARNING_P (t)); | |
1145 | hstate.add_flag (DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (t)); | |
1146 | hstate.add_flag (DECL_NO_LIMIT_STACK (t)); | |
1147 | hstate.add_flag (DECL_DISREGARD_INLINE_LIMITS (t)); | |
1148 | hstate.add_flag (DECL_PURE_P (t)); | |
1149 | hstate.add_flag (DECL_LOOPING_CONST_OR_PURE_P (t)); | |
1150 | hstate.commit_flag (); | |
8ceff600 | 1151 | if (DECL_BUILT_IN_CLASS (t) != NOT_BUILT_IN) |
d1170f8d | 1152 | hstate.add_int (DECL_UNCHECKED_FUNCTION_CODE (t)); |
8ceff600 | 1153 | } |
1154 | ||
1155 | if (CODE_CONTAINS_STRUCT (code, TS_TYPE_COMMON)) | |
1156 | { | |
eadcd69c | 1157 | hstate.add_hwi (TYPE_MODE (t)); |
cb274227 | 1158 | /* TYPE_NO_FORCE_BLK is private to stor-layout and need |
1159 | no streaming. */ | |
9da18bc6 | 1160 | hstate.add_flag (TYPE_PACKED (t)); |
1161 | hstate.add_flag (TYPE_RESTRICT (t)); | |
1162 | hstate.add_flag (TYPE_USER_ALIGN (t)); | |
1163 | hstate.add_flag (TYPE_READONLY (t)); | |
8ceff600 | 1164 | if (RECORD_OR_UNION_TYPE_P (t)) |
2d9cc481 | 1165 | { |
9da18bc6 | 1166 | hstate.add_flag (TYPE_TRANSPARENT_AGGR (t)); |
1167 | hstate.add_flag (TYPE_FINAL_P (t)); | |
aaabc7bc | 1168 | hstate.add_flag (TYPE_CXX_ODR_P (t)); |
2d9cc481 | 1169 | } |
8ceff600 | 1170 | else if (code == ARRAY_TYPE) |
9da18bc6 | 1171 | hstate.add_flag (TYPE_NONALIASED_COMPONENT (t)); |
aaabc7bc | 1172 | if (code == ARRAY_TYPE || code == INTEGER_TYPE) |
1173 | hstate.add_flag (TYPE_STRING_FLAG (t)); | |
3721b151 | 1174 | if (AGGREGATE_TYPE_P (t)) |
1175 | hstate.add_flag (TYPE_TYPELESS_STORAGE (t)); | |
9da18bc6 | 1176 | hstate.commit_flag (); |
1177 | hstate.add_int (TYPE_PRECISION (t)); | |
1178 | hstate.add_int (TYPE_ALIGN (t)); | |
532d84ff | 1179 | hstate.add_int (TYPE_EMPTY_P (t)); |
8ceff600 | 1180 | } |
1181 | ||
1182 | if (CODE_CONTAINS_STRUCT (code, TS_TRANSLATION_UNIT_DECL)) | |
9da18bc6 | 1183 | hstate.add (TRANSLATION_UNIT_LANGUAGE (t), |
1184 | strlen (TRANSLATION_UNIT_LANGUAGE (t))); | |
8ceff600 | 1185 | |
ba000093 | 1186 | if (CODE_CONTAINS_STRUCT (code, TS_TARGET_OPTION) |
1187 | /* We don't stream these when passing things to a different target. */ | |
1188 | && !lto_stream_offload_p) | |
eadcd69c | 1189 | hstate.add_hwi (cl_target_option_hash (TREE_TARGET_OPTION (t))); |
8ceff600 | 1190 | |
1191 | if (CODE_CONTAINS_STRUCT (code, TS_OPTIMIZATION)) | |
eadcd69c | 1192 | hstate.add_hwi (cl_optimization_hash (TREE_OPTIMIZATION (t))); |
8ceff600 | 1193 | |
1194 | if (CODE_CONTAINS_STRUCT (code, TS_IDENTIFIER)) | |
9da18bc6 | 1195 | hstate.merge_hash (IDENTIFIER_HASH_VALUE (t)); |
8ceff600 | 1196 | |
1197 | if (CODE_CONTAINS_STRUCT (code, TS_STRING)) | |
9da18bc6 | 1198 | hstate.add (TREE_STRING_POINTER (t), TREE_STRING_LENGTH (t)); |
8ceff600 | 1199 | |
1200 | if (CODE_CONTAINS_STRUCT (code, TS_TYPED)) | |
1201 | { | |
9e057653 | 1202 | if (code != IDENTIFIER_NODE) |
8ceff600 | 1203 | visit (TREE_TYPE (t)); |
1204 | } | |
1205 | ||
1206 | if (CODE_CONTAINS_STRUCT (code, TS_VECTOR)) | |
998afe5d | 1207 | { |
1208 | unsigned int count = vector_cst_encoded_nelts (t); | |
1209 | for (unsigned int i = 0; i < count; ++i) | |
1210 | visit (VECTOR_CST_ENCODED_ELT (t, i)); | |
1211 | } | |
8ceff600 | 1212 | |
8672ee56 | 1213 | if (CODE_CONTAINS_STRUCT (code, TS_POLY_INT_CST)) |
1214 | for (unsigned int i = 0; i < NUM_POLY_INT_COEFFS; ++i) | |
1215 | visit (POLY_INT_CST_COEFF (t, i)); | |
1216 | ||
8ceff600 | 1217 | if (CODE_CONTAINS_STRUCT (code, TS_COMPLEX)) |
1218 | { | |
1219 | visit (TREE_REALPART (t)); | |
1220 | visit (TREE_IMAGPART (t)); | |
1221 | } | |
1222 | ||
1223 | if (CODE_CONTAINS_STRUCT (code, TS_DECL_MINIMAL)) | |
1224 | { | |
1225 | /* Drop names that were created for anonymous entities. */ | |
1226 | if (DECL_NAME (t) | |
1227 | && TREE_CODE (DECL_NAME (t)) == IDENTIFIER_NODE | |
b95089a0 | 1228 | && IDENTIFIER_ANON_P (DECL_NAME (t))) |
8ceff600 | 1229 | ; |
1230 | else | |
1231 | visit (DECL_NAME (t)); | |
1232 | if (DECL_FILE_SCOPE_P (t)) | |
1233 | ; | |
1234 | else | |
1235 | visit (DECL_CONTEXT (t)); | |
1236 | } | |
1237 | ||
1238 | if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON)) | |
1239 | { | |
1240 | visit (DECL_SIZE (t)); | |
1241 | visit (DECL_SIZE_UNIT (t)); | |
1242 | visit (DECL_ATTRIBUTES (t)); | |
1243 | if ((code == VAR_DECL | |
1244 | || code == PARM_DECL) | |
1245 | && DECL_HAS_VALUE_EXPR_P (t)) | |
1246 | visit (DECL_VALUE_EXPR (t)); | |
1247 | if (code == VAR_DECL | |
1248 | && DECL_HAS_DEBUG_EXPR_P (t)) | |
1249 | visit (DECL_DEBUG_EXPR (t)); | |
1250 | /* ??? Hash DECL_INITIAL as streamed. Needs the output-block to | |
1251 | be able to call get_symbol_initial_value. */ | |
1252 | } | |
1253 | ||
8ceff600 | 1254 | if (CODE_CONTAINS_STRUCT (code, TS_DECL_WITH_VIS)) |
1255 | { | |
1256 | if (DECL_ASSEMBLER_NAME_SET_P (t)) | |
1257 | visit (DECL_ASSEMBLER_NAME (t)); | |
8ceff600 | 1258 | } |
1259 | ||
1260 | if (CODE_CONTAINS_STRUCT (code, TS_FIELD_DECL)) | |
1261 | { | |
1262 | visit (DECL_FIELD_OFFSET (t)); | |
1263 | visit (DECL_BIT_FIELD_TYPE (t)); | |
1264 | visit (DECL_BIT_FIELD_REPRESENTATIVE (t)); | |
1265 | visit (DECL_FIELD_BIT_OFFSET (t)); | |
8ceff600 | 1266 | } |
1267 | ||
1268 | if (CODE_CONTAINS_STRUCT (code, TS_FUNCTION_DECL)) | |
1269 | { | |
1270 | visit (DECL_FUNCTION_PERSONALITY (t)); | |
0fd94051 | 1271 | visit (DECL_FUNCTION_SPECIFIC_TARGET (t)); |
8ceff600 | 1272 | visit (DECL_FUNCTION_SPECIFIC_OPTIMIZATION (t)); |
1273 | } | |
1274 | ||
1275 | if (CODE_CONTAINS_STRUCT (code, TS_TYPE_COMMON)) | |
1276 | { | |
1277 | visit (TYPE_SIZE (t)); | |
1278 | visit (TYPE_SIZE_UNIT (t)); | |
1279 | visit (TYPE_ATTRIBUTES (t)); | |
1280 | visit (TYPE_NAME (t)); | |
1281 | visit (TYPE_MAIN_VARIANT (t)); | |
1282 | if (TYPE_FILE_SCOPE_P (t)) | |
1283 | ; | |
1284 | else | |
1285 | visit (TYPE_CONTEXT (t)); | |
8ceff600 | 1286 | } |
1287 | ||
1288 | if (CODE_CONTAINS_STRUCT (code, TS_TYPE_NON_COMMON)) | |
1289 | { | |
1290 | if (code == ENUMERAL_TYPE) | |
1291 | visit (TYPE_VALUES (t)); | |
1292 | else if (code == ARRAY_TYPE) | |
1293 | visit (TYPE_DOMAIN (t)); | |
1294 | else if (RECORD_OR_UNION_TYPE_P (t)) | |
1295 | for (tree f = TYPE_FIELDS (t); f; f = TREE_CHAIN (f)) | |
1296 | visit (f); | |
1297 | else if (code == FUNCTION_TYPE | |
1298 | || code == METHOD_TYPE) | |
1299 | visit (TYPE_ARG_TYPES (t)); | |
1300 | if (!POINTER_TYPE_P (t)) | |
c6f56d33 | 1301 | visit (TYPE_MIN_VALUE_RAW (t)); |
1302 | visit (TYPE_MAX_VALUE_RAW (t)); | |
8ceff600 | 1303 | } |
1304 | ||
1305 | if (CODE_CONTAINS_STRUCT (code, TS_LIST)) | |
1306 | { | |
1307 | visit (TREE_PURPOSE (t)); | |
1308 | visit (TREE_VALUE (t)); | |
1309 | visit (TREE_CHAIN (t)); | |
1310 | } | |
1311 | ||
1312 | if (CODE_CONTAINS_STRUCT (code, TS_VEC)) | |
1313 | for (int i = 0; i < TREE_VEC_LENGTH (t); ++i) | |
1314 | visit (TREE_VEC_ELT (t, i)); | |
1315 | ||
1316 | if (CODE_CONTAINS_STRUCT (code, TS_EXP)) | |
1317 | { | |
eadcd69c | 1318 | hstate.add_hwi (TREE_OPERAND_LENGTH (t)); |
8ceff600 | 1319 | for (int i = 0; i < TREE_OPERAND_LENGTH (t); ++i) |
1320 | visit (TREE_OPERAND (t, i)); | |
1321 | } | |
1322 | ||
1323 | if (CODE_CONTAINS_STRUCT (code, TS_BINFO)) | |
1324 | { | |
1325 | unsigned i; | |
1326 | tree b; | |
1327 | FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (t), i, b) | |
1328 | visit (b); | |
1329 | visit (BINFO_OFFSET (t)); | |
1330 | visit (BINFO_VTABLE (t)); | |
881fe02c | 1331 | /* Do not walk BINFO_INHERITANCE_CHAIN, BINFO_SUBVTT_INDEX |
42e9919f | 1332 | BINFO_BASE_ACCESSES and BINFO_VPTR_INDEX; these are used |
1333 | by C++ FE only. */ | |
8ceff600 | 1334 | } |
1335 | ||
1336 | if (CODE_CONTAINS_STRUCT (code, TS_CONSTRUCTOR)) | |
1337 | { | |
1338 | unsigned i; | |
1339 | tree index, value; | |
eadcd69c | 1340 | hstate.add_hwi (CONSTRUCTOR_NELTS (t)); |
8ceff600 | 1341 | FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t), i, index, value) |
1342 | { | |
1343 | visit (index); | |
1344 | visit (value); | |
1345 | } | |
1346 | } | |
1347 | ||
ea0695f9 | 1348 | if (code == OMP_CLAUSE) |
1349 | { | |
1350 | int i; | |
9da18bc6 | 1351 | HOST_WIDE_INT val; |
ea0695f9 | 1352 | |
eadcd69c | 1353 | hstate.add_hwi (OMP_CLAUSE_CODE (t)); |
ea0695f9 | 1354 | switch (OMP_CLAUSE_CODE (t)) |
1355 | { | |
1356 | case OMP_CLAUSE_DEFAULT: | |
9da18bc6 | 1357 | val = OMP_CLAUSE_DEFAULT_KIND (t); |
ea0695f9 | 1358 | break; |
1359 | case OMP_CLAUSE_SCHEDULE: | |
9da18bc6 | 1360 | val = OMP_CLAUSE_SCHEDULE_KIND (t); |
ea0695f9 | 1361 | break; |
1362 | case OMP_CLAUSE_DEPEND: | |
9da18bc6 | 1363 | val = OMP_CLAUSE_DEPEND_KIND (t); |
ea0695f9 | 1364 | break; |
1365 | case OMP_CLAUSE_MAP: | |
9da18bc6 | 1366 | val = OMP_CLAUSE_MAP_KIND (t); |
ea0695f9 | 1367 | break; |
1368 | case OMP_CLAUSE_PROC_BIND: | |
9da18bc6 | 1369 | val = OMP_CLAUSE_PROC_BIND_KIND (t); |
ea0695f9 | 1370 | break; |
1371 | case OMP_CLAUSE_REDUCTION: | |
7e5a76c8 | 1372 | case OMP_CLAUSE_TASK_REDUCTION: |
1373 | case OMP_CLAUSE_IN_REDUCTION: | |
9da18bc6 | 1374 | val = OMP_CLAUSE_REDUCTION_CODE (t); |
ea0695f9 | 1375 | break; |
1376 | default: | |
9da18bc6 | 1377 | val = 0; |
ea0695f9 | 1378 | break; |
1379 | } | |
eadcd69c | 1380 | hstate.add_hwi (val); |
ea0695f9 | 1381 | for (i = 0; i < omp_clause_num_ops[OMP_CLAUSE_CODE (t)]; i++) |
1382 | visit (OMP_CLAUSE_OPERAND (t, i)); | |
1383 | visit (OMP_CLAUSE_CHAIN (t)); | |
1384 | } | |
1385 | ||
9da18bc6 | 1386 | return hstate.end (); |
8ceff600 | 1387 | |
1388 | #undef visit | |
1389 | } | |
1390 | ||
1391 | /* Compare two SCC entries by their hash value for qsorting them. */ | |
1392 | ||
9e057653 | 1393 | int |
1394 | DFS::scc_entry_compare (const void *p1_, const void *p2_) | |
8ceff600 | 1395 | { |
1396 | const scc_entry *p1 = (const scc_entry *) p1_; | |
1397 | const scc_entry *p2 = (const scc_entry *) p2_; | |
1398 | if (p1->hash < p2->hash) | |
1399 | return -1; | |
1400 | else if (p1->hash > p2->hash) | |
1401 | return 1; | |
1402 | return 0; | |
1403 | } | |
1404 | ||
11e0a6ff | 1405 | /* Return a hash value for the SCC on the SCC stack from FIRST with SIZE. |
1406 | THIS_REF_P and REF_P are as passed to lto_output_tree for FIRST. */ | |
8ceff600 | 1407 | |
9e057653 | 1408 | hashval_t |
11e0a6ff | 1409 | DFS::hash_scc (struct output_block *ob, unsigned first, unsigned size, |
1410 | bool ref_p, bool this_ref_p) | |
8ceff600 | 1411 | { |
9e057653 | 1412 | unsigned int last_classes = 0, iterations = 0; |
1413 | ||
8ceff600 | 1414 | /* Compute hash values for the SCC members. */ |
1415 | for (unsigned i = 0; i < size; ++i) | |
25626f45 | 1416 | sccstack[first+i].hash |
1417 | = hash_tree (ob->writer_cache, NULL, sccstack[first+i].t); | |
8ceff600 | 1418 | |
1419 | if (size == 1) | |
1420 | return sccstack[first].hash; | |
1421 | ||
9e057653 | 1422 | /* We aim to get unique hash for every tree within SCC and compute hash value |
25626f45 | 1423 | of the whole SCC by combining all values together in a stable (entry-point |
9e057653 | 1424 | independent) order. This guarantees that the same SCC regions within |
1425 | different translation units will get the same hash values and therefore | |
1426 | will be merged at WPA time. | |
1427 | ||
25626f45 | 1428 | Often the hashes are already unique. In that case we compute the SCC hash |
9e057653 | 1429 | by combining individual hash values in an increasing order. |
1430 | ||
25626f45 | 1431 | If there are duplicates, we seek at least one tree with unique hash (and |
1432 | pick one with minimal hash and this property). Then we obtain a stable | |
1433 | order by DFS walk starting from this unique tree and then use the index | |
9e057653 | 1434 | within this order to make individual hash values unique. |
1435 | ||
1436 | If there is no tree with unique hash, we iteratively propagate the hash | |
1437 | values across the internal edges of SCC. This usually quickly leads | |
1438 | to unique hashes. Consider, for example, an SCC containing two pointers | |
25626f45 | 1439 | that are identical except for the types they point to and assume that |
1440 | these types are also part of the SCC. The propagation will add the | |
1441 | points-to type information into their hash values. */ | |
9e057653 | 1442 | do |
1443 | { | |
25626f45 | 1444 | /* Sort the SCC so we can easily check for uniqueness. */ |
9e057653 | 1445 | qsort (&sccstack[first], size, sizeof (scc_entry), scc_entry_compare); |
1446 | ||
1447 | unsigned int classes = 1; | |
1448 | int firstunique = -1; | |
1449 | ||
25626f45 | 1450 | /* Find the tree with lowest unique hash (if it exists) and compute |
1451 | the number of equivalence classes. */ | |
9e057653 | 1452 | if (sccstack[first].hash != sccstack[first+1].hash) |
1453 | firstunique = 0; | |
1454 | for (unsigned i = 1; i < size; ++i) | |
1455 | if (sccstack[first+i-1].hash != sccstack[first+i].hash) | |
1456 | { | |
1457 | classes++; | |
1458 | if (firstunique == -1 | |
1459 | && (i == size - 1 | |
1460 | || sccstack[first+i+1].hash != sccstack[first+i].hash)) | |
1461 | firstunique = i; | |
1462 | } | |
1463 | ||
25626f45 | 1464 | /* If we found a tree with unique hash, stop the iteration. */ |
9e057653 | 1465 | if (firstunique != -1 |
1466 | /* Also terminate if we run out of iterations or if the number of | |
1467 | equivalence classes is no longer increasing. | |
1468 | For example a cyclic list of trees that are all equivalent will | |
1469 | never have unique entry point; we however do not build such SCCs | |
1470 | in our IL. */ | |
1471 | || classes <= last_classes || iterations > 16) | |
1472 | { | |
1473 | hashval_t scc_hash; | |
1474 | ||
1475 | /* If some hashes are not unique (CLASSES != SIZE), use the DFS walk | |
25626f45 | 1476 | starting from FIRSTUNIQUE to obtain a stable order. */ |
9e057653 | 1477 | if (classes != size && firstunique != -1) |
1478 | { | |
1479 | hash_map <tree, hashval_t> map(size*2); | |
1480 | ||
1481 | /* Store hash values into a map, so we can associate them with | |
25626f45 | 1482 | the reordered SCC. */ |
9e057653 | 1483 | for (unsigned i = 0; i < size; ++i) |
1484 | map.put (sccstack[first+i].t, sccstack[first+i].hash); | |
1485 | ||
11e0a6ff | 1486 | DFS again (ob, sccstack[first+firstunique].t, ref_p, this_ref_p, |
1487 | true); | |
9e057653 | 1488 | gcc_assert (again.sccstack.length () == size); |
1489 | ||
1490 | memcpy (sccstack.address () + first, | |
1491 | again.sccstack.address (), | |
1492 | sizeof (scc_entry) * size); | |
1493 | ||
1494 | /* Update hash values of individual members by hashing in the | |
1495 | index within the stable order. This ensures uniqueness. | |
25626f45 | 1496 | Also compute the SCC hash by mixing in all hash values in |
1497 | the stable order we obtained. */ | |
9e057653 | 1498 | sccstack[first].hash = *map.get (sccstack[first].t); |
1499 | scc_hash = sccstack[first].hash; | |
1500 | for (unsigned i = 1; i < size; ++i) | |
1501 | { | |
1502 | sccstack[first+i].hash | |
1503 | = iterative_hash_hashval_t (i, | |
1504 | *map.get (sccstack[first+i].t)); | |
25626f45 | 1505 | scc_hash |
1506 | = iterative_hash_hashval_t (scc_hash, | |
1507 | sccstack[first+i].hash); | |
9e057653 | 1508 | } |
1509 | } | |
25626f45 | 1510 | /* If we got a unique hash value for each tree, then sort already |
1511 | ensured entry-point independent order. Only compute the final | |
1512 | SCC hash. | |
9e057653 | 1513 | |
1514 | If we failed to find the unique entry point, we go by the same | |
25626f45 | 1515 | route. We will eventually introduce unwanted hash conflicts. */ |
9e057653 | 1516 | else |
1517 | { | |
1518 | scc_hash = sccstack[first].hash; | |
1519 | for (unsigned i = 1; i < size; ++i) | |
25626f45 | 1520 | scc_hash |
1521 | = iterative_hash_hashval_t (scc_hash, sccstack[first+i].hash); | |
1522 | ||
1523 | /* We cannot 100% guarantee that the hash won't conflict so as | |
1524 | to make it impossible to find a unique hash. This however | |
1525 | should be an extremely rare case. ICE for now so possible | |
1526 | issues are found and evaluated. */ | |
9e057653 | 1527 | gcc_checking_assert (classes == size); |
1528 | } | |
1529 | ||
25626f45 | 1530 | /* To avoid conflicts across SCCs, iteratively hash the whole SCC |
1531 | hash into the hash of each element. */ | |
9e057653 | 1532 | for (unsigned i = 0; i < size; ++i) |
1533 | sccstack[first+i].hash | |
1534 | = iterative_hash_hashval_t (sccstack[first+i].hash, scc_hash); | |
1535 | return scc_hash; | |
1536 | } | |
1537 | ||
1538 | last_classes = classes; | |
1539 | iterations++; | |
1540 | ||
1541 | /* We failed to identify the entry point; propagate hash values across | |
1542 | the edges. */ | |
25626f45 | 1543 | hash_map <tree, hashval_t> map(size*2); |
1544 | ||
1545 | for (unsigned i = 0; i < size; ++i) | |
1546 | map.put (sccstack[first+i].t, sccstack[first+i].hash); | |
1547 | ||
1548 | for (unsigned i = 0; i < size; i++) | |
1549 | sccstack[first+i].hash | |
1550 | = hash_tree (ob->writer_cache, &map, sccstack[first+i].t); | |
9e057653 | 1551 | } |
1552 | while (true); | |
8ceff600 | 1553 | } |
1554 | ||
1555 | /* DFS walk EXPR and stream SCCs of tree bodies if they are not | |
1556 | already in the streamer cache. Main routine called for | |
1557 | each visit of EXPR. */ | |
1558 | ||
9e057653 | 1559 | void |
1560 | DFS::DFS_write_tree (struct output_block *ob, sccs *from_state, | |
35fafcb2 | 1561 | tree expr, bool ref_p, bool this_ref_p) |
8ceff600 | 1562 | { |
8ceff600 | 1563 | /* Handle special cases. */ |
1564 | if (expr == NULL_TREE) | |
1565 | return; | |
1566 | ||
1567 | /* Do not DFS walk into indexable trees. */ | |
1568 | if (this_ref_p && tree_is_indexable (expr)) | |
1569 | return; | |
1570 | ||
1571 | /* Check if we already streamed EXPR. */ | |
35fafcb2 | 1572 | if (streamer_tree_cache_lookup (ob->writer_cache, expr, NULL)) |
8ceff600 | 1573 | return; |
1574 | ||
35fafcb2 | 1575 | worklist w; |
1576 | w.expr = expr; | |
1577 | w.from_state = from_state; | |
1578 | w.cstate = NULL; | |
1579 | w.ref_p = ref_p; | |
1580 | w.this_ref_p = this_ref_p; | |
1581 | worklist_vec.safe_push (w); | |
8ceff600 | 1582 | } |
1583 | ||
515cf651 | 1584 | |
11e0a6ff | 1585 | /* Emit the physical representation of tree node EXPR to output block OB. |
1586 | If THIS_REF_P is true, the leaves of EXPR are emitted as references via | |
1587 | lto_output_tree_ref. REF_P is used for streaming siblings of EXPR. */ | |
515cf651 | 1588 | |
1589 | void | |
57bcbbf6 | 1590 | lto_output_tree (struct output_block *ob, tree expr, |
1591 | bool ref_p, bool this_ref_p) | |
515cf651 | 1592 | { |
1593 | unsigned ix; | |
1594 | bool existed_p; | |
1595 | ||
1596 | if (expr == NULL_TREE) | |
1597 | { | |
7f385784 | 1598 | streamer_write_record_start (ob, LTO_null); |
515cf651 | 1599 | return; |
1600 | } | |
1601 | ||
57bcbbf6 | 1602 | if (this_ref_p && tree_is_indexable (expr)) |
515cf651 | 1603 | { |
1604 | lto_output_tree_ref (ob, expr); | |
1605 | return; | |
1606 | } | |
1607 | ||
8ceff600 | 1608 | existed_p = streamer_tree_cache_lookup (ob->writer_cache, expr, &ix); |
515cf651 | 1609 | if (existed_p) |
1610 | { | |
1611 | /* If a node has already been streamed out, make sure that | |
1612 | we don't write it more than once. Otherwise, the reader | |
1613 | will instantiate two different nodes for the same object. */ | |
7f385784 | 1614 | streamer_write_record_start (ob, LTO_tree_pickle_reference); |
1615 | streamer_write_uhwi (ob, ix); | |
1616 | streamer_write_enum (ob->main_stream, LTO_tags, LTO_NUM_TAGS, | |
1617 | lto_tree_code_to_tag (TREE_CODE (expr))); | |
8ceff600 | 1618 | lto_stats.num_pickle_refs_output++; |
515cf651 | 1619 | } |
1620 | else | |
1621 | { | |
8ceff600 | 1622 | /* This is the first time we see EXPR, write all reachable |
1623 | trees to OB. */ | |
1624 | static bool in_dfs_walk; | |
1625 | ||
1626 | /* Protect against recursion which means disconnect between | |
1627 | what tree edges we walk in the DFS walk and what edges | |
1628 | we stream out. */ | |
1629 | gcc_assert (!in_dfs_walk); | |
1630 | ||
7858a084 | 1631 | if (streamer_dump_file) |
1632 | { | |
1633 | print_node_brief (streamer_dump_file, " Streaming SCC of ", | |
1634 | expr, 4); | |
1635 | fprintf (streamer_dump_file, "\n"); | |
1636 | } | |
1637 | ||
8ceff600 | 1638 | /* Start the DFS walk. */ |
1639 | /* Save ob state ... */ | |
1640 | /* let's see ... */ | |
1641 | in_dfs_walk = true; | |
9e057653 | 1642 | DFS (ob, expr, ref_p, this_ref_p, false); |
8ceff600 | 1643 | in_dfs_walk = false; |
1644 | ||
1645 | /* Finally append a reference to the tree we were writing. | |
1646 | ??? If expr ended up as a singleton we could have | |
1647 | inlined it here and avoid outputting a reference. */ | |
1648 | existed_p = streamer_tree_cache_lookup (ob->writer_cache, expr, &ix); | |
1649 | gcc_assert (existed_p); | |
1650 | streamer_write_record_start (ob, LTO_tree_pickle_reference); | |
1651 | streamer_write_uhwi (ob, ix); | |
1652 | streamer_write_enum (ob->main_stream, LTO_tags, LTO_NUM_TAGS, | |
1653 | lto_tree_code_to_tag (TREE_CODE (expr))); | |
7858a084 | 1654 | if (streamer_dump_file) |
1655 | { | |
1656 | print_node_brief (streamer_dump_file, " Finished SCC of ", | |
1657 | expr, 4); | |
1658 | fprintf (streamer_dump_file, "\n\n"); | |
1659 | } | |
8ceff600 | 1660 | lto_stats.num_pickle_refs_output++; |
7bfefa9d | 1661 | } |
1662 | } | |
1663 | ||
1664 | ||
1665 | /* Output to OB a list of try/catch handlers starting with FIRST. */ | |
1666 | ||
1667 | static void | |
1668 | output_eh_try_list (struct output_block *ob, eh_catch first) | |
1669 | { | |
1670 | eh_catch n; | |
1671 | ||
1672 | for (n = first; n; n = n->next_catch) | |
1673 | { | |
7f385784 | 1674 | streamer_write_record_start (ob, LTO_eh_catch); |
515cf651 | 1675 | stream_write_tree (ob, n->type_list, true); |
1676 | stream_write_tree (ob, n->filter_list, true); | |
1677 | stream_write_tree (ob, n->label, true); | |
7bfefa9d | 1678 | } |
1679 | ||
7f385784 | 1680 | streamer_write_record_start (ob, LTO_null); |
7bfefa9d | 1681 | } |
1682 | ||
1683 | ||
1684 | /* Output EH region R in function FN to OB. CURR_RN is the slot index | |
1685 | that is being emitted in FN->EH->REGION_ARRAY. This is used to | |
1686 | detect EH region sharing. */ | |
1687 | ||
1688 | static void | |
1689 | output_eh_region (struct output_block *ob, eh_region r) | |
1690 | { | |
1691 | enum LTO_tags tag; | |
1692 | ||
1693 | if (r == NULL) | |
1694 | { | |
7f385784 | 1695 | streamer_write_record_start (ob, LTO_null); |
7bfefa9d | 1696 | return; |
1697 | } | |
1698 | ||
1699 | if (r->type == ERT_CLEANUP) | |
1700 | tag = LTO_ert_cleanup; | |
1701 | else if (r->type == ERT_TRY) | |
1702 | tag = LTO_ert_try; | |
1703 | else if (r->type == ERT_ALLOWED_EXCEPTIONS) | |
1704 | tag = LTO_ert_allowed_exceptions; | |
1705 | else if (r->type == ERT_MUST_NOT_THROW) | |
1706 | tag = LTO_ert_must_not_throw; | |
1707 | else | |
1708 | gcc_unreachable (); | |
1709 | ||
7f385784 | 1710 | streamer_write_record_start (ob, tag); |
1711 | streamer_write_hwi (ob, r->index); | |
7bfefa9d | 1712 | |
1713 | if (r->outer) | |
7f385784 | 1714 | streamer_write_hwi (ob, r->outer->index); |
7bfefa9d | 1715 | else |
7f385784 | 1716 | streamer_write_zero (ob); |
7bfefa9d | 1717 | |
1718 | if (r->inner) | |
7f385784 | 1719 | streamer_write_hwi (ob, r->inner->index); |
7bfefa9d | 1720 | else |
7f385784 | 1721 | streamer_write_zero (ob); |
7bfefa9d | 1722 | |
1723 | if (r->next_peer) | |
7f385784 | 1724 | streamer_write_hwi (ob, r->next_peer->index); |
7bfefa9d | 1725 | else |
7f385784 | 1726 | streamer_write_zero (ob); |
7bfefa9d | 1727 | |
1728 | if (r->type == ERT_TRY) | |
1729 | { | |
1730 | output_eh_try_list (ob, r->u.eh_try.first_catch); | |
1731 | } | |
1732 | else if (r->type == ERT_ALLOWED_EXCEPTIONS) | |
1733 | { | |
515cf651 | 1734 | stream_write_tree (ob, r->u.allowed.type_list, true); |
1735 | stream_write_tree (ob, r->u.allowed.label, true); | |
7f385784 | 1736 | streamer_write_uhwi (ob, r->u.allowed.filter); |
7bfefa9d | 1737 | } |
1738 | else if (r->type == ERT_MUST_NOT_THROW) | |
1739 | { | |
515cf651 | 1740 | stream_write_tree (ob, r->u.must_not_throw.failure_decl, true); |
ec180527 | 1741 | bitpack_d bp = bitpack_create (ob->main_stream); |
1742 | stream_output_location (ob, &bp, r->u.must_not_throw.failure_loc); | |
1743 | streamer_write_bitpack (&bp); | |
7bfefa9d | 1744 | } |
1745 | ||
1746 | if (r->landing_pads) | |
7f385784 | 1747 | streamer_write_hwi (ob, r->landing_pads->index); |
7bfefa9d | 1748 | else |
7f385784 | 1749 | streamer_write_zero (ob); |
7bfefa9d | 1750 | } |
1751 | ||
1752 | ||
1753 | /* Output landing pad LP to OB. */ | |
1754 | ||
1755 | static void | |
1756 | output_eh_lp (struct output_block *ob, eh_landing_pad lp) | |
1757 | { | |
1758 | if (lp == NULL) | |
1759 | { | |
7f385784 | 1760 | streamer_write_record_start (ob, LTO_null); |
7bfefa9d | 1761 | return; |
1762 | } | |
1763 | ||
7f385784 | 1764 | streamer_write_record_start (ob, LTO_eh_landing_pad); |
1765 | streamer_write_hwi (ob, lp->index); | |
7bfefa9d | 1766 | if (lp->next_lp) |
7f385784 | 1767 | streamer_write_hwi (ob, lp->next_lp->index); |
7bfefa9d | 1768 | else |
7f385784 | 1769 | streamer_write_zero (ob); |
7bfefa9d | 1770 | |
1771 | if (lp->region) | |
7f385784 | 1772 | streamer_write_hwi (ob, lp->region->index); |
7bfefa9d | 1773 | else |
7f385784 | 1774 | streamer_write_zero (ob); |
7bfefa9d | 1775 | |
515cf651 | 1776 | stream_write_tree (ob, lp->post_landing_pad, true); |
7bfefa9d | 1777 | } |
1778 | ||
1779 | ||
1780 | /* Output the existing eh_table to OB. */ | |
1781 | ||
1782 | static void | |
1783 | output_eh_regions (struct output_block *ob, struct function *fn) | |
1784 | { | |
1785 | if (fn->eh && fn->eh->region_tree) | |
1786 | { | |
1787 | unsigned i; | |
1788 | eh_region eh; | |
1789 | eh_landing_pad lp; | |
1790 | tree ttype; | |
1791 | ||
7f385784 | 1792 | streamer_write_record_start (ob, LTO_eh_table); |
7bfefa9d | 1793 | |
1794 | /* Emit the index of the root of the EH region tree. */ | |
7f385784 | 1795 | streamer_write_hwi (ob, fn->eh->region_tree->index); |
7bfefa9d | 1796 | |
1797 | /* Emit all the EH regions in the region array. */ | |
f1f41a6c | 1798 | streamer_write_hwi (ob, vec_safe_length (fn->eh->region_array)); |
1799 | FOR_EACH_VEC_SAFE_ELT (fn->eh->region_array, i, eh) | |
7bfefa9d | 1800 | output_eh_region (ob, eh); |
1801 | ||
1802 | /* Emit all landing pads. */ | |
f1f41a6c | 1803 | streamer_write_hwi (ob, vec_safe_length (fn->eh->lp_array)); |
1804 | FOR_EACH_VEC_SAFE_ELT (fn->eh->lp_array, i, lp) | |
7bfefa9d | 1805 | output_eh_lp (ob, lp); |
1806 | ||
1807 | /* Emit all the runtime type data. */ | |
f1f41a6c | 1808 | streamer_write_hwi (ob, vec_safe_length (fn->eh->ttype_data)); |
1809 | FOR_EACH_VEC_SAFE_ELT (fn->eh->ttype_data, i, ttype) | |
515cf651 | 1810 | stream_write_tree (ob, ttype, true); |
7bfefa9d | 1811 | |
1812 | /* Emit the table of action chains. */ | |
1813 | if (targetm.arm_eabi_unwinder) | |
1814 | { | |
1815 | tree t; | |
f1f41a6c | 1816 | streamer_write_hwi (ob, vec_safe_length (fn->eh->ehspec_data.arm_eabi)); |
1817 | FOR_EACH_VEC_SAFE_ELT (fn->eh->ehspec_data.arm_eabi, i, t) | |
515cf651 | 1818 | stream_write_tree (ob, t, true); |
7bfefa9d | 1819 | } |
1820 | else | |
1821 | { | |
1822 | uchar c; | |
f1f41a6c | 1823 | streamer_write_hwi (ob, vec_safe_length (fn->eh->ehspec_data.other)); |
1824 | FOR_EACH_VEC_SAFE_ELT (fn->eh->ehspec_data.other, i, c) | |
7f385784 | 1825 | streamer_write_char_stream (ob->main_stream, c); |
7bfefa9d | 1826 | } |
1827 | } | |
1828 | ||
bb35cf1e | 1829 | /* The LTO_null either terminates the record or indicates that there |
1830 | are no eh_records at all. */ | |
7f385784 | 1831 | streamer_write_record_start (ob, LTO_null); |
7bfefa9d | 1832 | } |
1833 | ||
1834 | ||
1835 | /* Output all of the active ssa names to the ssa_names stream. */ | |
1836 | ||
1837 | static void | |
1838 | output_ssa_names (struct output_block *ob, struct function *fn) | |
1839 | { | |
1840 | unsigned int i, len; | |
1841 | ||
f1f41a6c | 1842 | len = vec_safe_length (SSANAMES (fn)); |
7f385784 | 1843 | streamer_write_uhwi (ob, len); |
7bfefa9d | 1844 | |
1845 | for (i = 1; i < len; i++) | |
1846 | { | |
f1f41a6c | 1847 | tree ptr = (*SSANAMES (fn))[i]; |
7bfefa9d | 1848 | |
1849 | if (ptr == NULL_TREE | |
1850 | || SSA_NAME_IN_FREE_LIST (ptr) | |
f29d86c7 | 1851 | || virtual_operand_p (ptr) |
1852 | /* Simply skip unreleased SSA names. */ | |
1853 | || (! SSA_NAME_IS_DEFAULT_DEF (ptr) | |
1854 | && (! SSA_NAME_DEF_STMT (ptr) | |
1855 | || ! gimple_bb (SSA_NAME_DEF_STMT (ptr))))) | |
7bfefa9d | 1856 | continue; |
1857 | ||
7f385784 | 1858 | streamer_write_uhwi (ob, i); |
1859 | streamer_write_char_stream (ob->main_stream, | |
1860 | SSA_NAME_IS_DEFAULT_DEF (ptr)); | |
ec11736b | 1861 | if (SSA_NAME_VAR (ptr)) |
1862 | stream_write_tree (ob, SSA_NAME_VAR (ptr), true); | |
1863 | else | |
1864 | /* ??? This drops SSA_NAME_IDENTIFIER on the floor. */ | |
1865 | stream_write_tree (ob, TREE_TYPE (ptr), true); | |
7bfefa9d | 1866 | } |
1867 | ||
7f385784 | 1868 | streamer_write_zero (ob); |
7bfefa9d | 1869 | } |
1870 | ||
1871 | ||
8b3716ff | 1872 | |
7bfefa9d | 1873 | /* Output the cfg. */ |
1874 | ||
1875 | static void | |
1876 | output_cfg (struct output_block *ob, struct function *fn) | |
1877 | { | |
1878 | struct lto_output_stream *tmp_stream = ob->main_stream; | |
1879 | basic_block bb; | |
1880 | ||
1881 | ob->main_stream = ob->cfg_stream; | |
1882 | ||
7f385784 | 1883 | streamer_write_enum (ob->main_stream, profile_status_d, PROFILE_LAST, |
3bedbae3 | 1884 | profile_status_for_fn (fn)); |
7bfefa9d | 1885 | |
1886 | /* Output the number of the highest basic block. */ | |
776b0663 | 1887 | streamer_write_uhwi (ob, last_basic_block_for_fn (fn)); |
7bfefa9d | 1888 | |
1889 | FOR_ALL_BB_FN (bb, fn) | |
1890 | { | |
1891 | edge_iterator ei; | |
1892 | edge e; | |
1893 | ||
7f385784 | 1894 | streamer_write_hwi (ob, bb->index); |
7bfefa9d | 1895 | |
1896 | /* Output the successors and the edge flags. */ | |
7f385784 | 1897 | streamer_write_uhwi (ob, EDGE_COUNT (bb->succs)); |
7bfefa9d | 1898 | FOR_EACH_EDGE (e, ei, bb->succs) |
1899 | { | |
7f385784 | 1900 | streamer_write_uhwi (ob, e->dest->index); |
720cfc43 | 1901 | e->probability.stream_out (ob); |
7f385784 | 1902 | streamer_write_uhwi (ob, e->flags); |
7bfefa9d | 1903 | } |
1904 | } | |
1905 | ||
7f385784 | 1906 | streamer_write_hwi (ob, -1); |
7bfefa9d | 1907 | |
614e788f | 1908 | bb = ENTRY_BLOCK_PTR_FOR_FN (fn); |
7bfefa9d | 1909 | while (bb->next_bb) |
1910 | { | |
7f385784 | 1911 | streamer_write_hwi (ob, bb->next_bb->index); |
7bfefa9d | 1912 | bb = bb->next_bb; |
1913 | } | |
1914 | ||
7f385784 | 1915 | streamer_write_hwi (ob, -1); |
7bfefa9d | 1916 | |
7a569539 | 1917 | /* Output the number of loops. */ |
41f75a99 | 1918 | streamer_write_uhwi (ob, number_of_loops (fn)); |
7a569539 | 1919 | |
1920 | /* Output each loop, skipping the tree root which has number zero. */ | |
41f75a99 | 1921 | for (unsigned i = 1; i < number_of_loops (fn); ++i) |
7a569539 | 1922 | { |
2e966e2a | 1923 | class loop *loop = get_loop (fn, i); |
7a569539 | 1924 | |
1925 | /* Write the index of the loop header. That's enough to rebuild | |
1926 | the loop tree on the reader side. Stream -1 for an unused | |
1927 | loop entry. */ | |
1928 | if (!loop) | |
1929 | { | |
1930 | streamer_write_hwi (ob, -1); | |
1931 | continue; | |
1932 | } | |
1933 | else | |
1934 | streamer_write_hwi (ob, loop->header->index); | |
1935 | ||
1936 | /* Write everything copy_loop_info copies. */ | |
1937 | streamer_write_enum (ob->main_stream, | |
1938 | loop_estimation, EST_LAST, loop->estimate_state); | |
1939 | streamer_write_hwi (ob, loop->any_upper_bound); | |
1940 | if (loop->any_upper_bound) | |
8cf48217 | 1941 | streamer_write_widest_int (ob, loop->nb_iterations_upper_bound); |
8e3ffe30 | 1942 | streamer_write_hwi (ob, loop->any_likely_upper_bound); |
1943 | if (loop->any_likely_upper_bound) | |
8cf48217 | 1944 | streamer_write_widest_int (ob, loop->nb_iterations_likely_upper_bound); |
7a569539 | 1945 | streamer_write_hwi (ob, loop->any_estimate); |
1946 | if (loop->any_estimate) | |
8cf48217 | 1947 | streamer_write_widest_int (ob, loop->nb_iterations_estimate); |
9978ce6d | 1948 | |
1949 | /* Write OMP SIMD related info. */ | |
1950 | streamer_write_hwi (ob, loop->safelen); | |
2a09b28c | 1951 | streamer_write_hwi (ob, loop->unroll); |
f13ef067 | 1952 | streamer_write_hwi (ob, loop->owned_clique); |
eb71996d | 1953 | streamer_write_hwi (ob, loop->dont_vectorize); |
4c73695b | 1954 | streamer_write_hwi (ob, loop->force_vectorize); |
9978ce6d | 1955 | stream_write_tree (ob, loop->simduid, true); |
7a569539 | 1956 | } |
1957 | ||
7bfefa9d | 1958 | ob->main_stream = tmp_stream; |
1959 | } | |
1960 | ||
1961 | ||
7bfefa9d | 1962 | /* Create the header in the file using OB. If the section type is for |
1963 | a function, set FN to the decl for that function. */ | |
1964 | ||
8867b500 | 1965 | void |
7bfefa9d | 1966 | produce_asm (struct output_block *ob, tree fn) |
1967 | { | |
1968 | enum lto_section_type section_type = ob->section_type; | |
1969 | struct lto_function_header header; | |
1970 | char *section_name; | |
7bfefa9d | 1971 | |
1972 | if (section_type == LTO_section_function_body) | |
1973 | { | |
1974 | const char *name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (fn)); | |
f18bad33 | 1975 | section_name = lto_get_section_name (section_type, name, NULL); |
7bfefa9d | 1976 | } |
1977 | else | |
f18bad33 | 1978 | section_name = lto_get_section_name (section_type, NULL, NULL); |
7bfefa9d | 1979 | |
1980 | lto_begin_section (section_name, !flag_wpa); | |
1981 | free (section_name); | |
1982 | ||
1983 | /* The entire header is stream computed here. */ | |
1984 | memset (&header, 0, sizeof (struct lto_function_header)); | |
48e1416a | 1985 | |
7bfefa9d | 1986 | if (section_type == LTO_section_function_body) |
1987 | header.cfg_size = ob->cfg_stream->total_size; | |
1988 | header.main_size = ob->main_stream->total_size; | |
1989 | header.string_size = ob->string_stream->total_size; | |
2d97af95 | 1990 | lto_write_data (&header, sizeof header); |
7bfefa9d | 1991 | |
1992 | /* Put all of the gimple and the string table out the asm file as a | |
1993 | block of text. */ | |
1994 | if (section_type == LTO_section_function_body) | |
1995 | lto_write_stream (ob->cfg_stream); | |
1996 | lto_write_stream (ob->main_stream); | |
1997 | lto_write_stream (ob->string_stream); | |
1998 | ||
1999 | lto_end_section (); | |
2000 | } | |
2001 | ||
2002 | ||
e4fc8eb2 | 2003 | /* Output the base body of struct function FN using output block OB. */ |
7bfefa9d | 2004 | |
2005 | static void | |
e4fc8eb2 | 2006 | output_struct_function_base (struct output_block *ob, struct function *fn) |
7bfefa9d | 2007 | { |
30baba90 | 2008 | struct bitpack_d bp; |
2ab2ce89 | 2009 | unsigned i; |
2010 | tree t; | |
7bfefa9d | 2011 | |
e4fc8eb2 | 2012 | /* Output the static chain and non-local goto save area. */ |
2013 | stream_write_tree (ob, fn->static_chain_decl, true); | |
2014 | stream_write_tree (ob, fn->nonlocal_goto_save_area, true); | |
7bfefa9d | 2015 | |
e4fc8eb2 | 2016 | /* Output all the local variables in the function. */ |
f1f41a6c | 2017 | streamer_write_hwi (ob, vec_safe_length (fn->local_decls)); |
2018 | FOR_EACH_VEC_SAFE_ELT (fn->local_decls, i, t) | |
e4fc8eb2 | 2019 | stream_write_tree (ob, t, true); |
7bfefa9d | 2020 | |
7a569539 | 2021 | /* Output current IL state of the function. */ |
2022 | streamer_write_uhwi (ob, fn->curr_properties); | |
7bfefa9d | 2023 | |
2024 | /* Write all the attributes for FN. */ | |
30baba90 | 2025 | bp = bitpack_create (ob->main_stream); |
2026 | bp_pack_value (&bp, fn->is_thunk, 1); | |
2027 | bp_pack_value (&bp, fn->has_local_explicit_reg_vars, 1); | |
30baba90 | 2028 | bp_pack_value (&bp, fn->returns_pcc_struct, 1); |
2029 | bp_pack_value (&bp, fn->returns_struct, 1); | |
2030 | bp_pack_value (&bp, fn->can_throw_non_call_exceptions, 1); | |
bc0dfc8d | 2031 | bp_pack_value (&bp, fn->can_delete_dead_exceptions, 1); |
30baba90 | 2032 | bp_pack_value (&bp, fn->always_inline_functions_inlined, 1); |
2033 | bp_pack_value (&bp, fn->after_inlining, 1); | |
30baba90 | 2034 | bp_pack_value (&bp, fn->stdarg, 1); |
2035 | bp_pack_value (&bp, fn->has_nonlocal_label, 1); | |
37af779a | 2036 | bp_pack_value (&bp, fn->has_forced_label_in_static, 1); |
30baba90 | 2037 | bp_pack_value (&bp, fn->calls_alloca, 1); |
2038 | bp_pack_value (&bp, fn->calls_setjmp, 1); | |
a9b358ce | 2039 | bp_pack_value (&bp, fn->calls_eh_return, 1); |
4c73695b | 2040 | bp_pack_value (&bp, fn->has_force_vectorize_loops, 1); |
9978ce6d | 2041 | bp_pack_value (&bp, fn->has_simduid_loops, 1); |
30baba90 | 2042 | bp_pack_value (&bp, fn->va_list_fpr_size, 8); |
2043 | bp_pack_value (&bp, fn->va_list_gpr_size, 8); | |
e70d82fd | 2044 | bp_pack_value (&bp, fn->last_clique, sizeof (short) * 8); |
ec180527 | 2045 | |
2046 | /* Output the function start and end loci. */ | |
2047 | stream_output_location (ob, &bp, fn->function_start_locus); | |
2048 | stream_output_location (ob, &bp, fn->function_end_locus); | |
2049 | ||
f89ca6e1 | 2050 | /* Save the instance discriminator if present. */ |
2051 | int *instance_number_p = NULL; | |
2052 | if (decl_to_instance_map) | |
2053 | instance_number_p = decl_to_instance_map->get (fn->decl); | |
2054 | bp_pack_value (&bp, !!instance_number_p, 1); | |
2055 | if (instance_number_p) | |
2056 | bp_pack_value (&bp, *instance_number_p, sizeof (int) * CHAR_BIT); | |
2057 | ||
7f385784 | 2058 | streamer_write_bitpack (&bp); |
e4fc8eb2 | 2059 | } |
7bfefa9d | 2060 | |
115697e0 | 2061 | |
5239471b | 2062 | /* Collect all leaf BLOCKs beyond ROOT into LEAFS. */ |
2063 | ||
2064 | static void | |
2065 | collect_block_tree_leafs (tree root, vec<tree> &leafs) | |
2066 | { | |
2067 | for (root = BLOCK_SUBBLOCKS (root); root; root = BLOCK_CHAIN (root)) | |
2068 | if (! BLOCK_SUBBLOCKS (root)) | |
2069 | leafs.safe_push (root); | |
2070 | else | |
2071 | collect_block_tree_leafs (BLOCK_SUBBLOCKS (root), leafs); | |
2072 | } | |
2073 | ||
614e788f | 2074 | /* This performs function body modifications that are needed for streaming |
2075 | to work. */ | |
2076 | ||
2077 | void | |
2078 | lto_prepare_function_for_streaming (struct cgraph_node *node) | |
2079 | { | |
f37784bf | 2080 | struct function *fn = DECL_STRUCT_FUNCTION (node->decl); |
2081 | basic_block bb; | |
2082 | ||
2083 | if (number_of_loops (fn)) | |
614e788f | 2084 | { |
f37784bf | 2085 | push_cfun (fn); |
614e788f | 2086 | loop_optimizer_init (AVOID_CFG_MODIFICATIONS); |
2087 | loop_optimizer_finalize (); | |
2088 | pop_cfun (); | |
2089 | } | |
f37784bf | 2090 | /* We will renumber the statements. The code that does this uses |
2091 | the same ordering that we use for serializing them so we can use | |
2092 | the same code on the other end and not have to write out the | |
2093 | statement numbers. We do not assign UIDs to PHIs here because | |
2094 | virtual PHIs get re-computed on-the-fly which would make numbers | |
2095 | inconsistent. */ | |
2096 | set_gimple_stmt_max_uid (fn, 0); | |
2097 | FOR_ALL_BB_FN (bb, fn) | |
2098 | { | |
2099 | for (gphi_iterator gsi = gsi_start_phis (bb); !gsi_end_p (gsi); | |
2100 | gsi_next (&gsi)) | |
2101 | { | |
2102 | gphi *stmt = gsi.phi (); | |
2103 | ||
2104 | /* Virtual PHIs are not going to be streamed. */ | |
2105 | if (!virtual_operand_p (gimple_phi_result (stmt))) | |
2106 | gimple_set_uid (stmt, inc_gimple_stmt_max_uid (fn)); | |
2107 | } | |
2108 | for (gimple_stmt_iterator gsi = gsi_start_bb (bb); !gsi_end_p (gsi); | |
2109 | gsi_next (&gsi)) | |
2110 | { | |
2111 | gimple *stmt = gsi_stmt (gsi); | |
2112 | gimple_set_uid (stmt, inc_gimple_stmt_max_uid (fn)); | |
2113 | } | |
2114 | } | |
2115 | /* To avoid keeping duplicate gimple IDs in the statements, renumber | |
2116 | virtual phis now. */ | |
2117 | FOR_ALL_BB_FN (bb, fn) | |
2118 | { | |
2119 | for (gphi_iterator gsi = gsi_start_phis (bb); !gsi_end_p (gsi); | |
2120 | gsi_next (&gsi)) | |
2121 | { | |
2122 | gphi *stmt = gsi.phi (); | |
2123 | if (virtual_operand_p (gimple_phi_result (stmt))) | |
2124 | gimple_set_uid (stmt, inc_gimple_stmt_max_uid (fn)); | |
2125 | } | |
2126 | } | |
2127 | ||
614e788f | 2128 | } |
2129 | ||
e4fc8eb2 | 2130 | /* Output the body of function NODE->DECL. */ |
7b76dcb9 | 2131 | |
e4fc8eb2 | 2132 | static void |
2133 | output_function (struct cgraph_node *node) | |
2134 | { | |
2135 | tree function; | |
2136 | struct function *fn; | |
2137 | basic_block bb; | |
2138 | struct output_block *ob; | |
7bfefa9d | 2139 | |
7858a084 | 2140 | if (streamer_dump_file) |
2141 | fprintf (streamer_dump_file, "\nStreaming body of %s\n", | |
2142 | node->name ()); | |
2143 | ||
02774f2d | 2144 | function = node->decl; |
e4fc8eb2 | 2145 | fn = DECL_STRUCT_FUNCTION (function); |
2146 | ob = create_output_block (LTO_section_function_body); | |
2147 | ||
2148 | clear_line_info (ob); | |
afb0d513 | 2149 | ob->symbol = node; |
e4fc8eb2 | 2150 | |
2151 | gcc_assert (current_function_decl == NULL_TREE && cfun == NULL); | |
2152 | ||
e4fc8eb2 | 2153 | /* Make string 0 be a NULL string. */ |
2154 | streamer_write_char_stream (ob->string_stream, 0); | |
2155 | ||
2156 | streamer_write_record_start (ob, LTO_function); | |
2157 | ||
4df870fd | 2158 | /* Output decls for parameters and args. */ |
2159 | stream_write_tree (ob, DECL_RESULT (function), true); | |
2160 | streamer_write_chain (ob, DECL_ARGUMENTS (function), true); | |
7bfefa9d | 2161 | |
7b53e714 | 2162 | /* Output debug args if available. */ |
2163 | vec<tree, va_gc> **debugargs = decl_debug_args_lookup (function); | |
2164 | if (! debugargs) | |
2165 | streamer_write_uhwi (ob, 0); | |
2166 | else | |
2167 | { | |
2168 | streamer_write_uhwi (ob, (*debugargs)->length ()); | |
2169 | for (unsigned i = 0; i < (*debugargs)->length (); ++i) | |
2170 | stream_write_tree (ob, (**debugargs)[i], true); | |
2171 | } | |
2172 | ||
7bfefa9d | 2173 | /* Output DECL_INITIAL for the function, which contains the tree of |
5239471b | 2174 | lexical scopes. */ |
515cf651 | 2175 | stream_write_tree (ob, DECL_INITIAL (function), true); |
5239471b | 2176 | /* As we do not recurse into BLOCK_SUBBLOCKS but only BLOCK_SUPERCONTEXT |
2177 | collect block tree leafs and stream those. */ | |
2178 | auto_vec<tree> block_tree_leafs; | |
2179 | if (DECL_INITIAL (function)) | |
2180 | collect_block_tree_leafs (DECL_INITIAL (function), block_tree_leafs); | |
2181 | streamer_write_uhwi (ob, block_tree_leafs.length ()); | |
2182 | for (unsigned i = 0; i < block_tree_leafs.length (); ++i) | |
2183 | stream_write_tree (ob, block_tree_leafs[i], true); | |
7bfefa9d | 2184 | |
4df870fd | 2185 | /* We also stream abstract functions where we stream only stuff needed for |
2186 | debug info. */ | |
2187 | if (gimple_has_body_p (function)) | |
2188 | { | |
2189 | streamer_write_uhwi (ob, 1); | |
2190 | output_struct_function_base (ob, fn); | |
2191 | ||
2192 | /* Output all the SSA names used in the function. */ | |
2193 | output_ssa_names (ob, fn); | |
2194 | ||
2195 | /* Output any exception handling regions. */ | |
2196 | output_eh_regions (ob, fn); | |
2197 | ||
4df870fd | 2198 | /* Output the code for the function. */ |
2199 | FOR_ALL_BB_FN (bb, fn) | |
2200 | output_bb (ob, bb, fn); | |
7bfefa9d | 2201 | |
4df870fd | 2202 | /* The terminator for this function. */ |
2203 | streamer_write_record_start (ob, LTO_null); | |
7bfefa9d | 2204 | |
4df870fd | 2205 | output_cfg (ob, fn); |
4df870fd | 2206 | } |
2207 | else | |
2208 | streamer_write_uhwi (ob, 0); | |
7bfefa9d | 2209 | |
2210 | /* Create a section to hold the pickled output of this function. */ | |
2211 | produce_asm (ob, function); | |
2212 | ||
2213 | destroy_output_block (ob); | |
7858a084 | 2214 | if (streamer_dump_file) |
2215 | fprintf (streamer_dump_file, "Finished streaming %s\n", | |
2216 | node->name ()); | |
7bfefa9d | 2217 | } |
2218 | ||
afb0d513 | 2219 | /* Output the body of function NODE->DECL. */ |
2220 | ||
2221 | static void | |
2222 | output_constructor (struct varpool_node *node) | |
2223 | { | |
2224 | tree var = node->decl; | |
2225 | struct output_block *ob; | |
2226 | ||
7858a084 | 2227 | if (streamer_dump_file) |
2228 | fprintf (streamer_dump_file, "\nStreaming constructor of %s\n", | |
2229 | node->name ()); | |
2230 | ||
afb0d513 | 2231 | ob = create_output_block (LTO_section_function_body); |
2232 | ||
2233 | clear_line_info (ob); | |
2234 | ob->symbol = node; | |
2235 | ||
2236 | /* Make string 0 be a NULL string. */ | |
2237 | streamer_write_char_stream (ob->string_stream, 0); | |
2238 | ||
2239 | /* Output DECL_INITIAL for the function, which contains the tree of | |
2240 | lexical scopes. */ | |
2241 | stream_write_tree (ob, DECL_INITIAL (var), true); | |
2242 | ||
2243 | /* Create a section to hold the pickled output of this function. */ | |
2244 | produce_asm (ob, var); | |
2245 | ||
2246 | destroy_output_block (ob); | |
7858a084 | 2247 | if (streamer_dump_file) |
2248 | fprintf (streamer_dump_file, "Finished streaming %s\n", | |
2249 | node->name ()); | |
afb0d513 | 2250 | } |
2251 | ||
7bfefa9d | 2252 | |
65d1b157 | 2253 | /* Emit toplevel asms. */ |
2254 | ||
2255 | void | |
2256 | lto_output_toplevel_asms (void) | |
2257 | { | |
2258 | struct output_block *ob; | |
cf951b1a | 2259 | struct asm_node *can; |
65d1b157 | 2260 | char *section_name; |
472ca566 | 2261 | struct lto_simple_header_with_strings header; |
65d1b157 | 2262 | |
35ee1c66 | 2263 | if (!symtab->first_asm_symbol ()) |
65d1b157 | 2264 | return; |
2265 | ||
2266 | ob = create_output_block (LTO_section_asm); | |
2267 | ||
2268 | /* Make string 0 be a NULL string. */ | |
2269 | streamer_write_char_stream (ob->string_stream, 0); | |
2270 | ||
35ee1c66 | 2271 | for (can = symtab->first_asm_symbol (); can; can = can->next) |
f1007c72 | 2272 | { |
2273 | streamer_write_string_cst (ob, ob->main_stream, can->asm_str); | |
2274 | streamer_write_hwi (ob, can->order); | |
2275 | } | |
65d1b157 | 2276 | |
2277 | streamer_write_string_cst (ob, ob->main_stream, NULL_TREE); | |
2278 | ||
2279 | section_name = lto_get_section_name (LTO_section_asm, NULL, NULL); | |
2280 | lto_begin_section (section_name, !flag_wpa); | |
2281 | free (section_name); | |
2282 | ||
2283 | /* The entire header stream is computed here. */ | |
2284 | memset (&header, 0, sizeof (header)); | |
2285 | ||
65d1b157 | 2286 | header.main_size = ob->main_stream->total_size; |
2287 | header.string_size = ob->string_stream->total_size; | |
2d97af95 | 2288 | lto_write_data (&header, sizeof header); |
65d1b157 | 2289 | |
2290 | /* Put all of the gimple and the string table out the asm file as a | |
2291 | block of text. */ | |
2292 | lto_write_stream (ob->main_stream); | |
2293 | lto_write_stream (ob->string_stream); | |
2294 | ||
2295 | lto_end_section (); | |
2296 | ||
2297 | destroy_output_block (ob); | |
2298 | } | |
2299 | ||
2300 | ||
afb0d513 | 2301 | /* Copy the function body or variable constructor of NODE without deserializing. */ |
7bfefa9d | 2302 | |
2303 | static void | |
afb0d513 | 2304 | copy_function_or_variable (struct symtab_node *node) |
7bfefa9d | 2305 | { |
02774f2d | 2306 | tree function = node->decl; |
2307 | struct lto_file_decl_data *file_data = node->lto_file_data; | |
7bfefa9d | 2308 | const char *data; |
2309 | size_t len; | |
2310 | const char *name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (function)); | |
151a56e7 | 2311 | char *section_name = |
f18bad33 | 2312 | lto_get_section_name (LTO_section_function_body, name, NULL); |
7bfefa9d | 2313 | size_t i, j; |
2314 | struct lto_in_decl_state *in_state; | |
151a56e7 | 2315 | struct lto_out_decl_state *out_state = lto_get_out_decl_state (); |
7bfefa9d | 2316 | |
10f4c874 | 2317 | if (streamer_dump_file) |
2318 | fprintf (streamer_dump_file, "Copying section for %s\n", name); | |
3afbcf4c | 2319 | lto_begin_section (section_name, false); |
7bfefa9d | 2320 | free (section_name); |
2321 | ||
2322 | /* We may have renamed the declaration, e.g., a static function. */ | |
2323 | name = lto_get_decl_name_mapping (file_data, name); | |
2324 | ||
3afbcf4c | 2325 | data = lto_get_raw_section_data (file_data, LTO_section_function_body, |
2326 | name, &len); | |
7bfefa9d | 2327 | gcc_assert (data); |
2328 | ||
2329 | /* Do a bit copy of the function body. */ | |
3afbcf4c | 2330 | lto_write_raw_data (data, len); |
7bfefa9d | 2331 | |
2332 | /* Copy decls. */ | |
2333 | in_state = | |
02774f2d | 2334 | lto_get_function_in_decl_state (node->lto_file_data, function); |
3afbcf4c | 2335 | out_state->compressed = in_state->compressed; |
7bfefa9d | 2336 | gcc_assert (in_state); |
2337 | ||
2338 | for (i = 0; i < LTO_N_DECL_STREAMS; i++) | |
2339 | { | |
5ecbd52e | 2340 | size_t n = vec_safe_length (in_state->streams[i]); |
2341 | vec<tree, va_gc> *trees = in_state->streams[i]; | |
7bfefa9d | 2342 | struct lto_tree_ref_encoder *encoder = &(out_state->streams[i]); |
2343 | ||
2344 | /* The out state must have the same indices and the in state. | |
2345 | So just copy the vector. All the encoders in the in state | |
2346 | must be empty where we reach here. */ | |
2347 | gcc_assert (lto_tree_ref_encoder_size (encoder) == 0); | |
32d76803 | 2348 | encoder->trees.reserve_exact (n); |
7bfefa9d | 2349 | for (j = 0; j < n; j++) |
5ecbd52e | 2350 | encoder->trees.safe_push ((*trees)[j]); |
7bfefa9d | 2351 | } |
48e1416a | 2352 | |
3afbcf4c | 2353 | lto_free_raw_section_data (file_data, LTO_section_function_body, name, |
2354 | data, len); | |
7bfefa9d | 2355 | lto_end_section (); |
2356 | } | |
2357 | ||
d9ef6695 | 2358 | /* Wrap symbol references in *TP inside a type-preserving MEM_REF. */ |
2359 | ||
2360 | static tree | |
2361 | wrap_refs (tree *tp, int *ws, void *) | |
2362 | { | |
2363 | tree t = *tp; | |
2364 | if (handled_component_p (t) | |
e21bcce8 | 2365 | && TREE_CODE (TREE_OPERAND (t, 0)) == VAR_DECL |
2366 | && TREE_PUBLIC (TREE_OPERAND (t, 0))) | |
d9ef6695 | 2367 | { |
2368 | tree decl = TREE_OPERAND (t, 0); | |
2369 | tree ptrtype = build_pointer_type (TREE_TYPE (decl)); | |
2370 | TREE_OPERAND (t, 0) = build2 (MEM_REF, TREE_TYPE (decl), | |
2371 | build1 (ADDR_EXPR, ptrtype, decl), | |
2372 | build_int_cst (ptrtype, 0)); | |
2373 | TREE_THIS_VOLATILE (TREE_OPERAND (t, 0)) = TREE_THIS_VOLATILE (decl); | |
2374 | *ws = 0; | |
2375 | } | |
2376 | else if (TREE_CODE (t) == CONSTRUCTOR) | |
2377 | ; | |
2378 | else if (!EXPR_P (t)) | |
2379 | *ws = 0; | |
2380 | return NULL_TREE; | |
2381 | } | |
7bfefa9d | 2382 | |
5458c829 | 2383 | /* Remove functions that are no longer used from offload_funcs, and mark the |
2384 | remaining ones with DECL_PRESERVE_P. */ | |
2385 | ||
2386 | static void | |
2387 | prune_offload_funcs (void) | |
2388 | { | |
2389 | if (!offload_funcs) | |
2390 | return; | |
2391 | ||
620610fa | 2392 | unsigned ix, ix2; |
2393 | tree *elem_ptr; | |
2394 | VEC_ORDERED_REMOVE_IF (*offload_funcs, ix, ix2, elem_ptr, | |
2395 | cgraph_node::get (*elem_ptr) == NULL); | |
2396 | ||
2397 | tree fn_decl; | |
2398 | FOR_EACH_VEC_ELT (*offload_funcs, ix, fn_decl) | |
2399 | DECL_PRESERVE_P (fn_decl) = 1; | |
5458c829 | 2400 | } |
2401 | ||
96a0ca19 | 2402 | /* Produce LTO section that contains global information |
2403 | about LTO bytecode. */ | |
2404 | ||
2405 | static void | |
2406 | produce_lto_section () | |
2407 | { | |
2408 | /* Stream LTO meta section. */ | |
2409 | output_block *ob = create_output_block (LTO_section_lto); | |
2410 | ||
2411 | char * section_name = lto_get_section_name (LTO_section_lto, NULL, NULL); | |
2412 | lto_begin_section (section_name, false); | |
2413 | free (section_name); | |
2414 | ||
3dcfd230 | 2415 | #ifdef HAVE_ZSTD_H |
2416 | lto_compression compression = ZSTD; | |
2417 | #else | |
96a0ca19 | 2418 | lto_compression compression = ZLIB; |
3dcfd230 | 2419 | #endif |
96a0ca19 | 2420 | |
2421 | bool slim_object = flag_generate_lto && !flag_fat_lto_objects; | |
2422 | lto_section s | |
88a70657 | 2423 | = { LTO_major_version, LTO_minor_version, slim_object, 0 }; |
2424 | s.set_compression (compression); | |
96a0ca19 | 2425 | lto_write_data (&s, sizeof s); |
2426 | lto_end_section (); | |
2427 | destroy_output_block (ob); | |
2428 | } | |
2429 | ||
7bfefa9d | 2430 | /* Main entry point from the pass manager. */ |
2431 | ||
79913f53 | 2432 | void |
eab36a5a | 2433 | lto_output (void) |
7bfefa9d | 2434 | { |
7bfefa9d | 2435 | struct lto_out_decl_state *decl_state; |
382ecba7 | 2436 | bitmap output = NULL; |
05358829 | 2437 | bitmap_obstack output_obstack; |
02b2818c | 2438 | int i, n_nodes; |
70225339 | 2439 | lto_symtab_encoder_t encoder = lto_get_out_decl_state ()->symtab_node_encoder; |
7bfefa9d | 2440 | |
5458c829 | 2441 | prune_offload_funcs (); |
2442 | ||
382ecba7 | 2443 | if (flag_checking) |
05358829 | 2444 | { |
2445 | bitmap_obstack_initialize (&output_obstack); | |
2446 | output = BITMAP_ALLOC (&output_obstack); | |
2447 | } | |
382ecba7 | 2448 | |
a0605d65 | 2449 | /* Initialize the streamer. */ |
2450 | lto_streamer_init (); | |
7bfefa9d | 2451 | |
96a0ca19 | 2452 | produce_lto_section (); |
2453 | ||
70225339 | 2454 | n_nodes = lto_symtab_encoder_size (encoder); |
7bfefa9d | 2455 | /* Process only the functions with bodies. */ |
02b2818c | 2456 | for (i = 0; i < n_nodes; i++) |
7bfefa9d | 2457 | { |
452659af | 2458 | symtab_node *snode = lto_symtab_encoder_deref (encoder, i); |
13cbeaac | 2459 | if (cgraph_node *node = dyn_cast <cgraph_node *> (snode)) |
7bfefa9d | 2460 | { |
d9ef6695 | 2461 | if (lto_symtab_encoder_encode_body_p (encoder, node) |
bb78a1de | 2462 | && !node->alias) |
d9ef6695 | 2463 | { |
382ecba7 | 2464 | if (flag_checking) |
05358829 | 2465 | gcc_assert (bitmap_set_bit (output, DECL_UID (node->decl))); |
d9ef6695 | 2466 | decl_state = lto_new_out_decl_state (); |
2467 | lto_push_out_decl_state (decl_state); | |
213acaba | 2468 | if (gimple_has_body_p (node->decl) |
2469 | || (!flag_wpa | |
2470 | && flag_incremental_link != INCREMENTAL_LINK_LTO) | |
a3a6d499 | 2471 | /* Thunks have no body but they may be synthetized |
2472 | at WPA time. */ | |
2473 | || DECL_ARGUMENTS (node->decl)) | |
d9ef6695 | 2474 | output_function (node); |
2475 | else | |
afb0d513 | 2476 | copy_function_or_variable (node); |
d9ef6695 | 2477 | gcc_assert (lto_get_out_decl_state () == decl_state); |
2478 | lto_pop_out_decl_state (); | |
2479 | lto_record_function_out_decl_state (node->decl, decl_state); | |
2480 | } | |
2481 | } | |
13cbeaac | 2482 | else if (varpool_node *node = dyn_cast <varpool_node *> (snode)) |
d9ef6695 | 2483 | { |
2484 | /* Wrap symbol references inside the ctor in a type | |
2485 | preserving MEM_REF. */ | |
2486 | tree ctor = DECL_INITIAL (node->decl); | |
2487 | if (ctor && !in_lto_p) | |
2488 | walk_tree (&ctor, wrap_refs, NULL, NULL); | |
afb0d513 | 2489 | if (get_symbol_initial_value (encoder, node->decl) == error_mark_node |
2490 | && lto_symtab_encoder_encode_initializer_p (encoder, node) | |
2491 | && !node->alias) | |
2492 | { | |
e52d4978 | 2493 | timevar_push (TV_IPA_LTO_CTORS_OUT); |
382ecba7 | 2494 | if (flag_checking) |
05358829 | 2495 | gcc_assert (bitmap_set_bit (output, DECL_UID (node->decl))); |
afb0d513 | 2496 | decl_state = lto_new_out_decl_state (); |
2497 | lto_push_out_decl_state (decl_state); | |
2498 | if (DECL_INITIAL (node->decl) != error_mark_node | |
213acaba | 2499 | || (!flag_wpa |
2500 | && flag_incremental_link != INCREMENTAL_LINK_LTO)) | |
afb0d513 | 2501 | output_constructor (node); |
2502 | else | |
2503 | copy_function_or_variable (node); | |
2504 | gcc_assert (lto_get_out_decl_state () == decl_state); | |
2505 | lto_pop_out_decl_state (); | |
2506 | lto_record_function_out_decl_state (node->decl, decl_state); | |
e52d4978 | 2507 | timevar_pop (TV_IPA_LTO_CTORS_OUT); |
afb0d513 | 2508 | } |
7bfefa9d | 2509 | } |
2510 | } | |
2511 | ||
2512 | /* Emit the callgraph after emitting function bodies. This needs to | |
2513 | be done now to make sure that all the statements in every function | |
2514 | have been renumbered so that edges can be associated with call | |
2515 | statements using the statement UIDs. */ | |
eab36a5a | 2516 | output_symtab (); |
7bfefa9d | 2517 | |
dccabdd1 | 2518 | output_offload_tables (); |
2519 | ||
05358829 | 2520 | if (flag_checking) |
2521 | { | |
2522 | BITMAP_FREE (output); | |
2523 | bitmap_obstack_release (&output_obstack); | |
2524 | } | |
7bfefa9d | 2525 | } |
2526 | ||
48e1416a | 2527 | /* Write each node in encoded by ENCODER to OB, as well as those reachable |
7bfefa9d | 2528 | from it and required for correct representation of its semantics. |
2529 | Each node in ENCODER must be a global declaration or a type. A node | |
2530 | is written only once, even if it appears multiple times in the | |
2531 | vector. Certain transitively-reachable nodes, such as those | |
2532 | representing expressions, may be duplicated, but such nodes | |
2533 | must not appear in ENCODER itself. */ | |
2534 | ||
2535 | static void | |
2536 | write_global_stream (struct output_block *ob, | |
2537 | struct lto_tree_ref_encoder *encoder) | |
2538 | { | |
2539 | tree t; | |
2540 | size_t index; | |
2541 | const size_t size = lto_tree_ref_encoder_size (encoder); | |
2542 | ||
2543 | for (index = 0; index < size; index++) | |
2544 | { | |
2545 | t = lto_tree_ref_encoder_get_tree (encoder, index); | |
7858a084 | 2546 | if (streamer_dump_file) |
2547 | { | |
2548 | fprintf (streamer_dump_file, " %i:", (int)index); | |
2549 | print_node_brief (streamer_dump_file, "", t, 4); | |
2550 | fprintf (streamer_dump_file, "\n"); | |
2551 | } | |
7f385784 | 2552 | if (!streamer_tree_cache_lookup (ob->writer_cache, t, NULL)) |
515cf651 | 2553 | stream_write_tree (ob, t, false); |
7bfefa9d | 2554 | } |
2555 | } | |
2556 | ||
2557 | ||
2558 | /* Write a sequence of indices into the globals vector corresponding | |
2559 | to the trees in ENCODER. These are used by the reader to map the | |
2560 | indices used to refer to global entities within function bodies to | |
2561 | their referents. */ | |
2562 | ||
2563 | static void | |
2564 | write_global_references (struct output_block *ob, | |
7bfefa9d | 2565 | struct lto_tree_ref_encoder *encoder) |
2566 | { | |
2567 | tree t; | |
5cd33168 | 2568 | uint32_t index; |
2569 | const uint32_t size = lto_tree_ref_encoder_size (encoder); | |
7bfefa9d | 2570 | |
2d97af95 | 2571 | /* Write size and slot indexes as 32-bit unsigned numbers. */ |
2572 | uint32_t *data = XNEWVEC (uint32_t, size + 1); | |
2573 | data[0] = size; | |
7bfefa9d | 2574 | |
2575 | for (index = 0; index < size; index++) | |
2576 | { | |
e974360c | 2577 | unsigned slot_num; |
7bfefa9d | 2578 | |
2579 | t = lto_tree_ref_encoder_get_tree (encoder, index); | |
7f385784 | 2580 | streamer_tree_cache_lookup (ob->writer_cache, t, &slot_num); |
5cd33168 | 2581 | gcc_assert (slot_num != (unsigned)-1); |
2d97af95 | 2582 | data[index + 1] = slot_num; |
7bfefa9d | 2583 | } |
2d97af95 | 2584 | |
2585 | lto_write_data (data, sizeof (int32_t) * (size + 1)); | |
2586 | free (data); | |
7bfefa9d | 2587 | } |
2588 | ||
2589 | ||
2590 | /* Write all the streams in an lto_out_decl_state STATE using | |
2591 | output block OB and output stream OUT_STREAM. */ | |
2592 | ||
284cc480 | 2593 | void |
7bfefa9d | 2594 | lto_output_decl_state_streams (struct output_block *ob, |
2595 | struct lto_out_decl_state *state) | |
2596 | { | |
2597 | int i; | |
2598 | ||
2599 | for (i = 0; i < LTO_N_DECL_STREAMS; i++) | |
2600 | write_global_stream (ob, &state->streams[i]); | |
2601 | } | |
2602 | ||
2603 | ||
2604 | /* Write all the references in an lto_out_decl_state STATE using | |
2605 | output block OB and output stream OUT_STREAM. */ | |
2606 | ||
284cc480 | 2607 | void |
7bfefa9d | 2608 | lto_output_decl_state_refs (struct output_block *ob, |
7bfefa9d | 2609 | struct lto_out_decl_state *state) |
2610 | { | |
2611 | unsigned i; | |
e974360c | 2612 | unsigned ref; |
7bfefa9d | 2613 | tree decl; |
48e1416a | 2614 | |
7bfefa9d | 2615 | /* Write reference to FUNCTION_DECL. If there is not function, |
2616 | write reference to void_type_node. */ | |
2617 | decl = (state->fn_decl) ? state->fn_decl : void_type_node; | |
7f385784 | 2618 | streamer_tree_cache_lookup (ob->writer_cache, decl, &ref); |
5cd33168 | 2619 | gcc_assert (ref != (unsigned)-1); |
3afbcf4c | 2620 | ref = ref * 2 + (state->compressed ? 1 : 0); |
2d97af95 | 2621 | lto_write_data (&ref, sizeof (uint32_t)); |
7bfefa9d | 2622 | |
2623 | for (i = 0; i < LTO_N_DECL_STREAMS; i++) | |
2d97af95 | 2624 | write_global_references (ob, &state->streams[i]); |
7bfefa9d | 2625 | } |
2626 | ||
2627 | ||
2628 | /* Return the written size of STATE. */ | |
2629 | ||
2630 | static size_t | |
2631 | lto_out_decl_state_written_size (struct lto_out_decl_state *state) | |
2632 | { | |
2633 | int i; | |
2634 | size_t size; | |
2635 | ||
2636 | size = sizeof (int32_t); /* fn_ref. */ | |
2637 | for (i = 0; i < LTO_N_DECL_STREAMS; i++) | |
2638 | { | |
2639 | size += sizeof (int32_t); /* vector size. */ | |
2640 | size += (lto_tree_ref_encoder_size (&state->streams[i]) | |
2641 | * sizeof (int32_t)); | |
2642 | } | |
2643 | return size; | |
2644 | } | |
2645 | ||
2646 | ||
d0daca65 | 2647 | /* Write symbol T into STREAM in CACHE. SEEN specifies symbols we wrote |
2648 | so far. */ | |
864a438f | 2649 | |
2650 | static void | |
7f385784 | 2651 | write_symbol (struct streamer_tree_cache_d *cache, |
431205b7 | 2652 | tree t, hash_set<const char *> *seen, bool alias) |
864a438f | 2653 | { |
2654 | const char *name; | |
2655 | enum gcc_plugin_symbol_kind kind; | |
5213d6c9 | 2656 | enum gcc_plugin_symbol_visibility visibility = GCCPV_DEFAULT; |
5cd33168 | 2657 | unsigned slot_num; |
3a4303e7 | 2658 | uint64_t size; |
864a438f | 2659 | const char *comdat; |
806416f6 | 2660 | unsigned char c; |
864a438f | 2661 | |
53e9c5c4 | 2662 | gcc_assert (VAR_OR_FUNCTION_DECL_P (t)); |
864a438f | 2663 | |
2664 | name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (t)); | |
2665 | ||
d86d364d | 2666 | /* This behaves like assemble_name_raw in varasm.c, performing the |
2667 | same name manipulations that ASM_OUTPUT_LABELREF does. */ | |
2668 | name = IDENTIFIER_POINTER ((*targetm.asm_out.mangle_assembler_name) (name)); | |
2669 | ||
431205b7 | 2670 | if (seen->add (name)) |
d0daca65 | 2671 | return; |
d0daca65 | 2672 | |
7f385784 | 2673 | streamer_tree_cache_lookup (cache, t, &slot_num); |
5cd33168 | 2674 | gcc_assert (slot_num != (unsigned)-1); |
864a438f | 2675 | |
864a438f | 2676 | if (DECL_EXTERNAL (t)) |
7bfefa9d | 2677 | { |
864a438f | 2678 | if (DECL_WEAK (t)) |
2679 | kind = GCCPK_WEAKUNDEF; | |
7bfefa9d | 2680 | else |
864a438f | 2681 | kind = GCCPK_UNDEF; |
2682 | } | |
2683 | else | |
2684 | { | |
2685 | if (DECL_WEAK (t)) | |
2686 | kind = GCCPK_WEAKDEF; | |
2687 | else if (DECL_COMMON (t)) | |
2688 | kind = GCCPK_COMMON; | |
7bfefa9d | 2689 | else |
864a438f | 2690 | kind = GCCPK_DEF; |
2691 | ||
d0daca65 | 2692 | /* When something is defined, it should have node attached. */ |
53e9c5c4 | 2693 | gcc_assert (alias || !VAR_P (t) || varpool_node::get (t)->definition); |
864a438f | 2694 | gcc_assert (alias || TREE_CODE (t) != FUNCTION_DECL |
415d1b9a | 2695 | || (cgraph_node::get (t) |
2696 | && cgraph_node::get (t)->definition)); | |
7bfefa9d | 2697 | } |
7bfefa9d | 2698 | |
eeb631b6 | 2699 | /* Imitate what default_elf_asm_output_external do. |
2700 | When symbol is external, we need to output it with DEFAULT visibility | |
2701 | when compiling with -fvisibility=default, while with HIDDEN visibility | |
2702 | when symbol has attribute (visibility("hidden")) specified. | |
2703 | targetm.binds_local_p check DECL_VISIBILITY_SPECIFIED and gets this | |
2704 | right. */ | |
949e5786 | 2705 | |
eeb631b6 | 2706 | if (DECL_EXTERNAL (t) |
2707 | && !targetm.binds_local_p (t)) | |
2708 | visibility = GCCPV_DEFAULT; | |
2709 | else | |
9af5ce0c | 2710 | switch (DECL_VISIBILITY (t)) |
eeb631b6 | 2711 | { |
2712 | case VISIBILITY_DEFAULT: | |
2713 | visibility = GCCPV_DEFAULT; | |
2714 | break; | |
2715 | case VISIBILITY_PROTECTED: | |
2716 | visibility = GCCPV_PROTECTED; | |
2717 | break; | |
2718 | case VISIBILITY_HIDDEN: | |
2719 | visibility = GCCPV_HIDDEN; | |
2720 | break; | |
2721 | case VISIBILITY_INTERNAL: | |
2722 | visibility = GCCPV_INTERNAL; | |
2723 | break; | |
2724 | } | |
7bfefa9d | 2725 | |
864a438f | 2726 | if (kind == GCCPK_COMMON |
949e5786 | 2727 | && DECL_SIZE_UNIT (t) |
2728 | && TREE_CODE (DECL_SIZE_UNIT (t)) == INTEGER_CST) | |
f9ae6f95 | 2729 | size = TREE_INT_CST_LOW (DECL_SIZE_UNIT (t)); |
864a438f | 2730 | else |
2731 | size = 0; | |
2732 | ||
2733 | if (DECL_ONE_ONLY (t)) | |
1d9ca4f0 | 2734 | comdat = IDENTIFIER_POINTER (decl_comdat_group_id (t)); |
864a438f | 2735 | else |
2736 | comdat = ""; | |
2737 | ||
2d97af95 | 2738 | lto_write_data (name, strlen (name) + 1); |
2739 | lto_write_data (comdat, strlen (comdat) + 1); | |
806416f6 | 2740 | c = (unsigned char) kind; |
2d97af95 | 2741 | lto_write_data (&c, 1); |
806416f6 | 2742 | c = (unsigned char) visibility; |
2d97af95 | 2743 | lto_write_data (&c, 1); |
2744 | lto_write_data (&size, 8); | |
2745 | lto_write_data (&slot_num, 4); | |
7bfefa9d | 2746 | } |
2747 | ||
864a438f | 2748 | /* Write an IL symbol table to OB. |
2749 | SET and VSET are cgraph/varpool node sets we are outputting. */ | |
7bfefa9d | 2750 | |
2751 | static void | |
18a71d50 | 2752 | produce_symtab (struct output_block *ob) |
7bfefa9d | 2753 | { |
7f385784 | 2754 | struct streamer_tree_cache_d *cache = ob->writer_cache; |
f18bad33 | 2755 | char *section_name = lto_get_section_name (LTO_section_symtab, NULL, NULL); |
70225339 | 2756 | lto_symtab_encoder_t encoder = ob->decl_state->symtab_node_encoder; |
337dec35 | 2757 | lto_symtab_encoder_iterator lsei; |
7bfefa9d | 2758 | |
2759 | lto_begin_section (section_name, false); | |
2760 | free (section_name); | |
2761 | ||
431205b7 | 2762 | hash_set<const char *> seen; |
864a438f | 2763 | |
337dec35 | 2764 | /* Write the symbol table. |
2765 | First write everything defined and then all declarations. | |
75de4aa2 | 2766 | This is necessary to handle cases where we have duplicated symbols. */ |
337dec35 | 2767 | for (lsei = lsei_start (encoder); |
2768 | !lsei_end_p (lsei); lsei_next (&lsei)) | |
864a438f | 2769 | { |
452659af | 2770 | symtab_node *node = lsei_node (lsei); |
337dec35 | 2771 | |
fa30257b | 2772 | if (DECL_EXTERNAL (node->decl) || !node->output_to_lto_symbol_table_p ()) |
d0daca65 | 2773 | continue; |
431205b7 | 2774 | write_symbol (cache, node->decl, &seen, false); |
d0daca65 | 2775 | } |
337dec35 | 2776 | for (lsei = lsei_start (encoder); |
2777 | !lsei_end_p (lsei); lsei_next (&lsei)) | |
d0daca65 | 2778 | { |
452659af | 2779 | symtab_node *node = lsei_node (lsei); |
864a438f | 2780 | |
fa30257b | 2781 | if (!DECL_EXTERNAL (node->decl) || !node->output_to_lto_symbol_table_p ()) |
d0daca65 | 2782 | continue; |
431205b7 | 2783 | write_symbol (cache, node->decl, &seen, false); |
864a438f | 2784 | } |
2785 | ||
7bfefa9d | 2786 | lto_end_section (); |
2787 | } | |
2788 | ||
2789 | ||
2e971afd | 2790 | /* Init the streamer_mode_table for output, where we collect info on what |
2791 | machine_mode values have been streamed. */ | |
2792 | void | |
2793 | lto_output_init_mode_table (void) | |
2794 | { | |
2795 | memset (streamer_mode_table, '\0', MAX_MACHINE_MODE); | |
2796 | } | |
2797 | ||
2798 | ||
2799 | /* Write the mode table. */ | |
2800 | static void | |
2801 | lto_write_mode_table (void) | |
2802 | { | |
2803 | struct output_block *ob; | |
2804 | ob = create_output_block (LTO_section_mode_table); | |
2805 | bitpack_d bp = bitpack_create (ob->main_stream); | |
2806 | ||
b308f4a0 | 2807 | /* Ensure that for GET_MODE_INNER (m) != m we have |
2e971afd | 2808 | also the inner mode marked. */ |
2809 | for (int i = 0; i < (int) MAX_MACHINE_MODE; i++) | |
2810 | if (streamer_mode_table[i]) | |
2811 | { | |
2812 | machine_mode m = (machine_mode) i; | |
c2423c1d | 2813 | machine_mode inner_m = GET_MODE_INNER (m); |
2814 | if (inner_m != m) | |
2815 | streamer_mode_table[(int) inner_m] = 1; | |
2e971afd | 2816 | } |
b308f4a0 | 2817 | /* First stream modes that have GET_MODE_INNER (m) == m, |
2e971afd | 2818 | so that we can refer to them afterwards. */ |
2819 | for (int pass = 0; pass < 2; pass++) | |
2820 | for (int i = 0; i < (int) MAX_MACHINE_MODE; i++) | |
2821 | if (streamer_mode_table[i] && i != (int) VOIDmode && i != (int) BLKmode) | |
2822 | { | |
2823 | machine_mode m = (machine_mode) i; | |
d145b68b | 2824 | if ((GET_MODE_INNER (m) == m) ^ (pass == 0)) |
2e971afd | 2825 | continue; |
2826 | bp_pack_value (&bp, m, 8); | |
2827 | bp_pack_enum (&bp, mode_class, MAX_MODE_CLASS, GET_MODE_CLASS (m)); | |
52acb7ae | 2828 | bp_pack_poly_value (&bp, GET_MODE_SIZE (m), 16); |
3ce67adc | 2829 | bp_pack_poly_value (&bp, GET_MODE_PRECISION (m), 16); |
2e971afd | 2830 | bp_pack_value (&bp, GET_MODE_INNER (m), 8); |
ba7efd65 | 2831 | bp_pack_poly_value (&bp, GET_MODE_NUNITS (m), 16); |
2e971afd | 2832 | switch (GET_MODE_CLASS (m)) |
2833 | { | |
2834 | case MODE_FRACT: | |
2835 | case MODE_UFRACT: | |
2836 | case MODE_ACCUM: | |
2837 | case MODE_UACCUM: | |
2838 | bp_pack_value (&bp, GET_MODE_IBIT (m), 8); | |
2839 | bp_pack_value (&bp, GET_MODE_FBIT (m), 8); | |
2840 | break; | |
2841 | case MODE_FLOAT: | |
2842 | case MODE_DECIMAL_FLOAT: | |
2843 | bp_pack_string (ob, &bp, REAL_MODE_FORMAT (m)->name, true); | |
2844 | break; | |
2845 | default: | |
2846 | break; | |
2847 | } | |
2848 | bp_pack_string (ob, &bp, GET_MODE_NAME (m), true); | |
2849 | } | |
2850 | bp_pack_value (&bp, VOIDmode, 8); | |
2851 | ||
2852 | streamer_write_bitpack (&bp); | |
2853 | ||
2854 | char *section_name | |
2855 | = lto_get_section_name (LTO_section_mode_table, NULL, NULL); | |
2856 | lto_begin_section (section_name, !flag_wpa); | |
2857 | free (section_name); | |
2858 | ||
2859 | /* The entire header stream is computed here. */ | |
2860 | struct lto_simple_header_with_strings header; | |
2861 | memset (&header, 0, sizeof (header)); | |
2862 | ||
2e971afd | 2863 | header.main_size = ob->main_stream->total_size; |
2864 | header.string_size = ob->string_stream->total_size; | |
2865 | lto_write_data (&header, sizeof header); | |
2866 | ||
2867 | /* Put all of the gimple and the string table out the asm file as a | |
2868 | block of text. */ | |
2869 | lto_write_stream (ob->main_stream); | |
2870 | lto_write_stream (ob->string_stream); | |
2871 | ||
2872 | lto_end_section (); | |
2873 | destroy_output_block (ob); | |
2874 | } | |
2875 | ||
2876 | ||
7bfefa9d | 2877 | /* This pass is run after all of the functions are serialized and all |
2878 | of the IPA passes have written their serialized forms. This pass | |
2879 | causes the vector of all of the global decls and types used from | |
2880 | this file to be written in to a section that can then be read in to | |
2881 | recover these on other side. */ | |
2882 | ||
79913f53 | 2883 | void |
eab36a5a | 2884 | produce_asm_for_decls (void) |
7bfefa9d | 2885 | { |
2886 | struct lto_out_decl_state *out_state; | |
2887 | struct lto_out_decl_state *fn_out_state; | |
2888 | struct lto_decl_header header; | |
2889 | char *section_name; | |
2890 | struct output_block *ob; | |
7bfefa9d | 2891 | unsigned idx, num_fns; |
2892 | size_t decl_state_size; | |
2893 | int32_t num_decl_states; | |
2894 | ||
2895 | ob = create_output_block (LTO_section_decls); | |
7bfefa9d | 2896 | |
48e1416a | 2897 | memset (&header, 0, sizeof (struct lto_decl_header)); |
7bfefa9d | 2898 | |
f18bad33 | 2899 | section_name = lto_get_section_name (LTO_section_decls, NULL, NULL); |
7bfefa9d | 2900 | lto_begin_section (section_name, !flag_wpa); |
2901 | free (section_name); | |
2902 | ||
2903 | /* Make string 0 be a NULL string. */ | |
7f385784 | 2904 | streamer_write_char_stream (ob->string_stream, 0); |
7bfefa9d | 2905 | |
18a71d50 | 2906 | gcc_assert (!alias_pairs); |
2907 | ||
b1e946ea | 2908 | /* Get rid of the global decl state hash tables to save some memory. */ |
7bfefa9d | 2909 | out_state = lto_get_out_decl_state (); |
b1e946ea | 2910 | for (int i = 0; i < LTO_N_DECL_STREAMS; i++) |
2911 | if (out_state->streams[i].tree_hash_table) | |
2912 | { | |
2913 | delete out_state->streams[i].tree_hash_table; | |
2914 | out_state->streams[i].tree_hash_table = NULL; | |
2915 | } | |
2916 | ||
2917 | /* Write the global symbols. */ | |
7858a084 | 2918 | if (streamer_dump_file) |
2919 | fprintf (streamer_dump_file, "Outputting global stream\n"); | |
7bfefa9d | 2920 | lto_output_decl_state_streams (ob, out_state); |
b1e946ea | 2921 | num_fns = lto_function_decl_states.length (); |
7bfefa9d | 2922 | for (idx = 0; idx < num_fns; idx++) |
2923 | { | |
2924 | fn_out_state = | |
f1f41a6c | 2925 | lto_function_decl_states[idx]; |
7858a084 | 2926 | if (streamer_dump_file) |
2927 | fprintf (streamer_dump_file, "Outputting stream for %s\n", | |
2928 | IDENTIFIER_POINTER | |
2929 | (DECL_ASSEMBLER_NAME (fn_out_state->fn_decl))); | |
7bfefa9d | 2930 | lto_output_decl_state_streams (ob, fn_out_state); |
2931 | } | |
2932 | ||
7bfefa9d | 2933 | /* Currently not used. This field would allow us to preallocate |
2934 | the globals vector, so that it need not be resized as it is extended. */ | |
2935 | header.num_nodes = -1; | |
2936 | ||
2937 | /* Compute the total size of all decl out states. */ | |
2938 | decl_state_size = sizeof (int32_t); | |
2939 | decl_state_size += lto_out_decl_state_written_size (out_state); | |
2940 | for (idx = 0; idx < num_fns; idx++) | |
2941 | { | |
2942 | fn_out_state = | |
f1f41a6c | 2943 | lto_function_decl_states[idx]; |
7bfefa9d | 2944 | decl_state_size += lto_out_decl_state_written_size (fn_out_state); |
2945 | } | |
2946 | header.decl_state_size = decl_state_size; | |
2947 | ||
2948 | header.main_size = ob->main_stream->total_size; | |
2949 | header.string_size = ob->string_stream->total_size; | |
2950 | ||
2d97af95 | 2951 | lto_write_data (&header, sizeof header); |
48e1416a | 2952 | |
7bfefa9d | 2953 | /* Write the main out-decl state, followed by out-decl states of |
2954 | functions. */ | |
7bfefa9d | 2955 | num_decl_states = num_fns + 1; |
2d97af95 | 2956 | lto_write_data (&num_decl_states, sizeof (num_decl_states)); |
2957 | lto_output_decl_state_refs (ob, out_state); | |
7bfefa9d | 2958 | for (idx = 0; idx < num_fns; idx++) |
2959 | { | |
2d97af95 | 2960 | fn_out_state = lto_function_decl_states[idx]; |
2961 | lto_output_decl_state_refs (ob, fn_out_state); | |
7bfefa9d | 2962 | } |
7bfefa9d | 2963 | |
2964 | lto_write_stream (ob->main_stream); | |
2965 | lto_write_stream (ob->string_stream); | |
2966 | ||
2967 | lto_end_section (); | |
2968 | ||
864a438f | 2969 | /* Write the symbol table. It is used by linker to determine dependencies |
2970 | and thus we can skip it for WPA. */ | |
2971 | if (!flag_wpa) | |
18a71d50 | 2972 | produce_symtab (ob); |
7bfefa9d | 2973 | |
2974 | /* Write command line opts. */ | |
2975 | lto_write_options (); | |
2976 | ||
2977 | /* Deallocate memory and clean up. */ | |
dcbc7a08 | 2978 | for (idx = 0; idx < num_fns; idx++) |
2979 | { | |
2980 | fn_out_state = | |
f1f41a6c | 2981 | lto_function_decl_states[idx]; |
dcbc7a08 | 2982 | lto_delete_out_decl_state (fn_out_state); |
2983 | } | |
70225339 | 2984 | lto_symtab_encoder_delete (ob->decl_state->symtab_node_encoder); |
f1f41a6c | 2985 | lto_function_decl_states.release (); |
7bfefa9d | 2986 | destroy_output_block (ob); |
2e971afd | 2987 | if (lto_stream_offload_p) |
2988 | lto_write_mode_table (); | |
7bfefa9d | 2989 | } |