1 /* Write the GIMPLE representation to a file stream.
3 Copyright 2009, 2010 Free Software Foundation, Inc.
4 Contributed by Kenneth Zadeck <zadeck@naturalbridge.com>
5 Re-implemented by Diego Novillo <dnovillo@google.com>
7 This file is part of GCC.
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
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
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/>. */
25 #include "coretypes.h"
35 #include "basic-block.h"
36 #include "tree-flow.h"
37 #include "tree-pass.h"
41 #include "diagnostic.h"
44 #include "lto-symtab.h"
45 #include "lto-streamer.h"
52 unsigned int slot_num;
56 /* Returns a hash code for P. */
59 hash_string_slot_node (const void *p)
61 const struct string_slot *ds = (const struct string_slot *) p;
62 return (hashval_t) htab_hash_string (ds->s);
66 /* Returns nonzero if P1 and P2 are equal. */
69 eq_string_slot_node (const void *p1, const void *p2)
71 const struct string_slot *ds1 = (const struct string_slot *) p1;
72 const struct string_slot *ds2 = (const struct string_slot *) p2;
74 if (ds1->len == ds2->len)
77 for (i = 0; i < ds1->len; i++)
78 if (ds1->s[i] != ds2->s[i])
87 /* Free the string slot pointed-to by P. */
90 string_slot_free (void *p)
92 struct string_slot *slot = (struct string_slot *) p;
93 free (CONST_CAST (void *, (const void *) slot->s));
98 /* Clear the line info stored in DATA_IN. */
101 clear_line_info (struct output_block *ob)
103 ob->current_file = NULL;
104 ob->current_line = 0;
109 /* Create the output block and return it. SECTION_TYPE is
110 LTO_section_function_body or LTO_static_initializer. */
112 struct output_block *
113 create_output_block (enum lto_section_type section_type)
115 struct output_block *ob = XCNEW (struct output_block);
117 ob->section_type = section_type;
118 ob->decl_state = lto_get_out_decl_state ();
119 ob->main_stream = XCNEW (struct lto_output_stream);
120 ob->string_stream = XCNEW (struct lto_output_stream);
121 ob->writer_cache = lto_streamer_cache_create ();
123 if (section_type == LTO_section_function_body)
124 ob->cfg_stream = XCNEW (struct lto_output_stream);
126 clear_line_info (ob);
128 ob->string_hash_table = htab_create (37, hash_string_slot_node,
129 eq_string_slot_node, string_slot_free);
135 /* Destroy the output block OB. */
138 destroy_output_block (struct output_block *ob)
140 enum lto_section_type section_type = ob->section_type;
142 htab_delete (ob->string_hash_table);
144 free (ob->main_stream);
145 free (ob->string_stream);
146 if (section_type == LTO_section_function_body)
147 free (ob->cfg_stream);
149 lto_streamer_cache_delete (ob->writer_cache);
155 /* Output bitpack BP to output stream S. */
158 lto_output_bitpack (struct lto_output_stream *s, struct bitpack_d *bp)
163 lto_output_uleb128_stream (s, VEC_length (bitpack_word_t, bp->values));
164 for (i = 0; VEC_iterate (bitpack_word_t, bp->values, i, v); i++)
165 lto_output_uleb128_stream (s, v);
169 /* Output STRING of LEN characters to the string
170 table in OB. The string might or might not include a trailing '\0'.
171 Then put the index onto the INDEX_STREAM. */
174 output_string_with_length (struct output_block *ob,
175 struct lto_output_stream *index_stream,
179 struct string_slot **slot;
180 struct string_slot s_slot;
181 char *string = (char *) xmalloc (len + 1);
182 memcpy (string, s, len);
189 slot = (struct string_slot **) htab_find_slot (ob->string_hash_table,
193 struct lto_output_stream *string_stream = ob->string_stream;
194 unsigned int start = string_stream->total_size;
195 struct string_slot *new_slot
196 = (struct string_slot *) xmalloc (sizeof (struct string_slot));
199 new_slot->s = string;
201 new_slot->slot_num = start;
203 lto_output_uleb128_stream (index_stream, start);
204 lto_output_uleb128_stream (string_stream, len);
205 for (i = 0; i < len; i++)
206 lto_output_1_stream (string_stream, string[i]);
210 struct string_slot *old_slot = (struct string_slot *)*slot;
211 lto_output_uleb128_stream (index_stream, old_slot->slot_num);
216 /* Output the '\0' terminated STRING to the string
217 table in OB. Then put the index onto the INDEX_STREAM. */
220 output_string (struct output_block *ob,
221 struct lto_output_stream *index_stream,
226 lto_output_uleb128_stream (index_stream, 0);
227 output_string_with_length (ob, index_stream, string, strlen (string) + 1);
230 lto_output_uleb128_stream (index_stream, 1);
234 /* Output the STRING constant to the string
235 table in OB. Then put the index onto the INDEX_STREAM. */
238 output_string_cst (struct output_block *ob,
239 struct lto_output_stream *index_stream,
244 lto_output_uleb128_stream (index_stream, 0);
245 output_string_with_length (ob, index_stream,
246 TREE_STRING_POINTER (string),
247 TREE_STRING_LENGTH (string));
250 lto_output_uleb128_stream (index_stream, 1);
254 /* Output the identifier ID to the string
255 table in OB. Then put the index onto the INDEX_STREAM. */
258 output_identifier (struct output_block *ob,
259 struct lto_output_stream *index_stream,
264 lto_output_uleb128_stream (index_stream, 0);
265 output_string_with_length (ob, index_stream,
266 IDENTIFIER_POINTER (id),
267 IDENTIFIER_LENGTH (id));
270 lto_output_uleb128_stream (index_stream, 1);
273 /* Write a zero to the output stream. */
276 output_zero (struct output_block *ob)
278 lto_output_1_stream (ob->main_stream, 0);
282 /* Output an unsigned LEB128 quantity to OB->main_stream. */
285 output_uleb128 (struct output_block *ob, unsigned HOST_WIDE_INT work)
287 lto_output_uleb128_stream (ob->main_stream, work);
291 /* Output a signed LEB128 quantity to OB->main_stream. */
294 output_sleb128 (struct output_block *ob, HOST_WIDE_INT work)
296 lto_output_sleb128_stream (ob->main_stream, work);
300 /* Output the start of a record with TAG to output block OB. */
303 output_record_start (struct output_block *ob, enum LTO_tags tag)
305 /* Make sure TAG fits inside an unsigned int. */
306 gcc_assert (tag == (enum LTO_tags) (unsigned) tag);
307 output_uleb128 (ob, tag);
311 /* Look up NODE in the type table and write the index for it to OB. */
314 output_type_ref (struct output_block *ob, tree node)
316 output_record_start (ob, LTO_type_ref);
317 lto_output_type_ref_index (ob->decl_state, ob->main_stream, node);
321 /* Pack all the non-pointer fields of the TS_BASE structure of
322 expression EXPR into bitpack BP. */
325 pack_ts_base_value_fields (struct bitpack_d *bp, tree expr)
327 bp_pack_value (bp, TREE_CODE (expr), 16);
330 bp_pack_value (bp, TREE_SIDE_EFFECTS (expr), 1);
331 bp_pack_value (bp, TREE_CONSTANT (expr), 1);
332 bp_pack_value (bp, TREE_READONLY (expr), 1);
334 /* TREE_PUBLIC is used on types to indicate that the type
335 has a TYPE_CACHED_VALUES vector. This is not streamed out,
336 so we skip it here. */
337 bp_pack_value (bp, TREE_PUBLIC (expr), 1);
339 bp_pack_value (bp, TREE_ADDRESSABLE (expr), 1);
340 bp_pack_value (bp, TREE_THIS_VOLATILE (expr), 1);
342 bp_pack_value (bp, DECL_UNSIGNED (expr), 1);
343 else if (TYPE_P (expr))
344 bp_pack_value (bp, TYPE_UNSIGNED (expr), 1);
345 /* We write debug info two times, do not confuse the second one. */
346 bp_pack_value (bp, TYPE_P (expr) ? 0 : TREE_ASM_WRITTEN (expr), 1);
347 bp_pack_value (bp, TREE_NO_WARNING (expr), 1);
348 bp_pack_value (bp, TREE_USED (expr), 1);
349 bp_pack_value (bp, TREE_NOTHROW (expr), 1);
350 bp_pack_value (bp, TREE_STATIC (expr), 1);
351 bp_pack_value (bp, TREE_PRIVATE (expr), 1);
352 bp_pack_value (bp, TREE_PROTECTED (expr), 1);
353 bp_pack_value (bp, TREE_DEPRECATED (expr), 1);
355 bp_pack_value (bp, TYPE_SATURATING (expr), 1);
356 if (TREE_CODE (expr) == SSA_NAME)
357 bp_pack_value (bp, SSA_NAME_IS_DEFAULT_DEF (expr), 1);
361 /* Pack all the non-pointer fields of the TS_REAL_CST structure of
362 expression EXPR into bitpack BP. */
365 pack_ts_real_cst_value_fields (struct bitpack_d *bp, tree expr)
370 r = TREE_REAL_CST (expr);
371 bp_pack_value (bp, r.cl, 2);
372 bp_pack_value (bp, r.decimal, 1);
373 bp_pack_value (bp, r.sign, 1);
374 bp_pack_value (bp, r.signalling, 1);
375 bp_pack_value (bp, r.canonical, 1);
376 bp_pack_value (bp, r.uexp, EXP_BITS);
377 for (i = 0; i < SIGSZ; i++)
378 bp_pack_value (bp, r.sig[i], HOST_BITS_PER_LONG);
382 /* Pack all the non-pointer fields of the TS_FIXED_CST structure of
383 expression EXPR into bitpack BP. */
386 pack_ts_fixed_cst_value_fields (struct bitpack_d *bp, tree expr)
388 struct fixed_value fv = TREE_FIXED_CST (expr);
389 bp_pack_value (bp, fv.data.low, HOST_BITS_PER_WIDE_INT);
390 bp_pack_value (bp, fv.data.high, HOST_BITS_PER_WIDE_INT);
394 /* Pack all the non-pointer fields of the TS_DECL_COMMON structure
395 of expression EXPR into bitpack BP. */
398 pack_ts_decl_common_value_fields (struct bitpack_d *bp, tree expr)
400 bp_pack_value (bp, DECL_MODE (expr), 8);
401 bp_pack_value (bp, DECL_NONLOCAL (expr), 1);
402 bp_pack_value (bp, DECL_VIRTUAL_P (expr), 1);
403 bp_pack_value (bp, DECL_IGNORED_P (expr), 1);
404 bp_pack_value (bp, DECL_ABSTRACT (expr), 1);
405 bp_pack_value (bp, DECL_ARTIFICIAL (expr), 1);
406 bp_pack_value (bp, DECL_USER_ALIGN (expr), 1);
407 bp_pack_value (bp, DECL_PRESERVE_P (expr), 1);
408 bp_pack_value (bp, DECL_DEBUG_EXPR_IS_FROM (expr), 1);
409 bp_pack_value (bp, DECL_EXTERNAL (expr), 1);
410 bp_pack_value (bp, DECL_GIMPLE_REG_P (expr), 1);
411 bp_pack_value (bp, DECL_ALIGN (expr), HOST_BITS_PER_INT);
413 if (TREE_CODE (expr) == LABEL_DECL)
415 /* Note that we do not write LABEL_DECL_UID. The reader will
416 always assume an initial value of -1 so that the
417 label_to_block_map is recreated by gimple_set_bb. */
418 bp_pack_value (bp, DECL_ERROR_ISSUED (expr), 1);
419 bp_pack_value (bp, EH_LANDING_PAD_NR (expr), HOST_BITS_PER_INT);
422 if (TREE_CODE (expr) == FIELD_DECL)
424 bp_pack_value (bp, DECL_PACKED (expr), 1);
425 bp_pack_value (bp, DECL_NONADDRESSABLE_P (expr), 1);
426 bp_pack_value (bp, DECL_OFFSET_ALIGN (expr), 8);
429 if (TREE_CODE (expr) == RESULT_DECL
430 || TREE_CODE (expr) == PARM_DECL
431 || TREE_CODE (expr) == VAR_DECL)
433 bp_pack_value (bp, DECL_BY_REFERENCE (expr), 1);
434 if (TREE_CODE (expr) == VAR_DECL
435 || TREE_CODE (expr) == PARM_DECL)
436 bp_pack_value (bp, DECL_HAS_VALUE_EXPR_P (expr), 1);
437 bp_pack_value (bp, DECL_RESTRICTED_P (expr), 1);
442 /* Pack all the non-pointer fields of the TS_DECL_WRTL structure
443 of expression EXPR into bitpack BP. */
446 pack_ts_decl_wrtl_value_fields (struct bitpack_d *bp, tree expr)
448 bp_pack_value (bp, DECL_REGISTER (expr), 1);
452 /* Pack all the non-pointer fields of the TS_DECL_WITH_VIS structure
453 of expression EXPR into bitpack BP. */
456 pack_ts_decl_with_vis_value_fields (struct bitpack_d *bp, tree expr)
458 bp_pack_value (bp, DECL_DEFER_OUTPUT (expr), 1);
459 bp_pack_value (bp, DECL_COMMON (expr), 1);
460 bp_pack_value (bp, DECL_DLLIMPORT_P (expr), 1);
461 bp_pack_value (bp, DECL_WEAK (expr), 1);
462 bp_pack_value (bp, DECL_SEEN_IN_BIND_EXPR_P (expr), 1);
463 bp_pack_value (bp, DECL_COMDAT (expr), 1);
464 bp_pack_value (bp, DECL_VISIBILITY (expr), 2);
465 bp_pack_value (bp, DECL_VISIBILITY_SPECIFIED (expr), 1);
467 if (TREE_CODE (expr) == VAR_DECL)
469 bp_pack_value (bp, DECL_HARD_REGISTER (expr), 1);
470 bp_pack_value (bp, DECL_IN_TEXT_SECTION (expr), 1);
471 bp_pack_value (bp, DECL_IN_CONSTANT_POOL (expr), 1);
472 bp_pack_value (bp, DECL_TLS_MODEL (expr), 3);
475 if (VAR_OR_FUNCTION_DECL_P (expr))
476 bp_pack_value (bp, DECL_INIT_PRIORITY (expr), HOST_BITS_PER_SHORT);
480 /* Pack all the non-pointer fields of the TS_FUNCTION_DECL structure
481 of expression EXPR into bitpack BP. */
484 pack_ts_function_decl_value_fields (struct bitpack_d *bp, tree expr)
486 /* For normal/md builtins we only write the class and code, so they
487 should never be handled here. */
488 gcc_assert (!lto_stream_as_builtin_p (expr));
490 bp_pack_value (bp, DECL_FUNCTION_CODE (expr), 11);
491 bp_pack_value (bp, DECL_BUILT_IN_CLASS (expr), 2);
492 bp_pack_value (bp, DECL_STATIC_CONSTRUCTOR (expr), 1);
493 bp_pack_value (bp, DECL_STATIC_DESTRUCTOR (expr), 1);
494 bp_pack_value (bp, DECL_UNINLINABLE (expr), 1);
495 bp_pack_value (bp, DECL_POSSIBLY_INLINED (expr), 1);
496 bp_pack_value (bp, DECL_IS_NOVOPS (expr), 1);
497 bp_pack_value (bp, DECL_IS_RETURNS_TWICE (expr), 1);
498 bp_pack_value (bp, DECL_IS_MALLOC (expr), 1);
499 bp_pack_value (bp, DECL_IS_OPERATOR_NEW (expr), 1);
500 bp_pack_value (bp, DECL_DECLARED_INLINE_P (expr), 1);
501 bp_pack_value (bp, DECL_STATIC_CHAIN (expr), 1);
502 bp_pack_value (bp, DECL_NO_INLINE_WARNING_P (expr), 1);
503 bp_pack_value (bp, DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (expr), 1);
504 bp_pack_value (bp, DECL_NO_LIMIT_STACK (expr), 1);
505 bp_pack_value (bp, DECL_DISREGARD_INLINE_LIMITS (expr), 1);
506 bp_pack_value (bp, DECL_PURE_P (expr), 1);
507 bp_pack_value (bp, DECL_LOOPING_CONST_OR_PURE_P (expr), 1);
511 /* Pack all the non-pointer fields of the TS_TYPE structure
512 of expression EXPR into bitpack BP. */
515 pack_ts_type_value_fields (struct bitpack_d *bp, tree expr)
517 bp_pack_value (bp, TYPE_PRECISION (expr), 9);
518 bp_pack_value (bp, TYPE_MODE (expr), 7);
519 bp_pack_value (bp, TYPE_STRING_FLAG (expr), 1);
520 bp_pack_value (bp, TYPE_NO_FORCE_BLK (expr), 1);
521 bp_pack_value (bp, TYPE_NEEDS_CONSTRUCTING (expr), 1);
522 if (RECORD_OR_UNION_TYPE_P (expr))
523 bp_pack_value (bp, TYPE_TRANSPARENT_AGGR (expr), 1);
524 bp_pack_value (bp, TYPE_PACKED (expr), 1);
525 bp_pack_value (bp, TYPE_RESTRICT (expr), 1);
526 bp_pack_value (bp, TYPE_CONTAINS_PLACEHOLDER_INTERNAL (expr), 2);
527 bp_pack_value (bp, TYPE_USER_ALIGN (expr), 1);
528 bp_pack_value (bp, TYPE_READONLY (expr), 1);
529 bp_pack_value (bp, TYPE_ALIGN (expr), HOST_BITS_PER_INT);
530 bp_pack_value (bp, TYPE_ALIAS_SET (expr) == 0 ? 0 : -1, HOST_BITS_PER_INT);
534 /* Pack all the non-pointer fields of the TS_BLOCK structure
535 of expression EXPR into bitpack BP. */
538 pack_ts_block_value_fields (struct bitpack_d *bp, tree expr)
540 bp_pack_value (bp, BLOCK_ABSTRACT (expr), 1);
541 bp_pack_value (bp, BLOCK_NUMBER (expr), 31);
545 /* Pack all the non-pointer fields in EXPR into a bit pack. */
547 static struct bitpack_d *
548 pack_value_fields (tree expr)
551 struct bitpack_d *bp;
553 code = TREE_CODE (expr);
554 bp = bitpack_create ();
556 /* Note that all these functions are highly sensitive to changes in
557 the types and sizes of each of the fields being packed. */
558 pack_ts_base_value_fields (bp, expr);
560 if (CODE_CONTAINS_STRUCT (code, TS_REAL_CST))
561 pack_ts_real_cst_value_fields (bp, expr);
563 if (CODE_CONTAINS_STRUCT (code, TS_FIXED_CST))
564 pack_ts_fixed_cst_value_fields (bp, expr);
566 if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
567 pack_ts_decl_common_value_fields (bp, expr);
569 if (CODE_CONTAINS_STRUCT (code, TS_DECL_WRTL))
570 pack_ts_decl_wrtl_value_fields (bp, expr);
572 if (CODE_CONTAINS_STRUCT (code, TS_DECL_WITH_VIS))
573 pack_ts_decl_with_vis_value_fields (bp, expr);
575 if (CODE_CONTAINS_STRUCT (code, TS_FUNCTION_DECL))
576 pack_ts_function_decl_value_fields (bp, expr);
578 if (CODE_CONTAINS_STRUCT (code, TS_TYPE))
579 pack_ts_type_value_fields (bp, expr);
581 if (CODE_CONTAINS_STRUCT (code, TS_BLOCK))
582 pack_ts_block_value_fields (bp, expr);
584 if (CODE_CONTAINS_STRUCT (code, TS_SSA_NAME))
586 /* We only stream the version number of SSA names. */
590 if (CODE_CONTAINS_STRUCT (code, TS_STATEMENT_LIST))
592 /* This is only used by GENERIC. */
596 if (CODE_CONTAINS_STRUCT (code, TS_OMP_CLAUSE))
598 /* This is only used by High GIMPLE. */
606 /* Emit location LOC to output block OB. */
609 lto_output_location (struct output_block *ob, location_t loc)
611 expanded_location xloc;
613 if (loc == UNKNOWN_LOCATION)
615 output_string (ob, ob->main_stream, NULL);
619 xloc = expand_location (loc);
621 output_string (ob, ob->main_stream, xloc.file);
622 output_sleb128 (ob, xloc.line);
623 output_sleb128 (ob, xloc.column);
624 output_sleb128 (ob, xloc.sysp);
626 ob->current_file = xloc.file;
627 ob->current_line = xloc.line;
628 ob->current_col = xloc.column;
632 /* Return true if tree node T is written to various tables. For these
633 nodes, we sometimes want to write their phyiscal representation
634 (via lto_output_tree), and sometimes we need to emit an index
635 reference into a table (via lto_output_tree_ref). */
638 tree_is_indexable (tree t)
640 if (TREE_CODE (t) == PARM_DECL)
642 else if (TREE_CODE (t) == VAR_DECL && decl_function_context (t)
646 return (TYPE_P (t) || DECL_P (t) || TREE_CODE (t) == SSA_NAME);
650 /* If EXPR is an indexable tree node, output a reference to it to
651 output block OB. Otherwise, output the physical representation of
655 lto_output_tree_ref (struct output_block *ob, tree expr)
659 if (expr == NULL_TREE)
665 if (!tree_is_indexable (expr))
667 /* Even though we are emitting the physical representation of
668 EXPR, its leaves must be emitted as references. */
669 lto_output_tree (ob, expr, true);
675 output_type_ref (ob, expr);
679 code = TREE_CODE (expr);
683 output_record_start (ob, LTO_ssa_name_ref);
684 output_uleb128 (ob, SSA_NAME_VERSION (expr));
688 output_record_start (ob, LTO_field_decl_ref);
689 lto_output_field_decl_index (ob->decl_state, ob->main_stream, expr);
693 output_record_start (ob, LTO_function_decl_ref);
694 lto_output_fn_decl_index (ob->decl_state, ob->main_stream, expr);
698 case DEBUG_EXPR_DECL:
699 gcc_assert (decl_function_context (expr) == NULL
700 || TREE_STATIC (expr));
701 output_record_start (ob, LTO_global_decl_ref);
702 lto_output_var_decl_index (ob->decl_state, ob->main_stream, expr);
706 output_record_start (ob, LTO_const_decl_ref);
707 lto_output_var_decl_index (ob->decl_state, ob->main_stream, expr);
711 gcc_assert (decl_function_context (expr) == NULL);
712 output_record_start (ob, LTO_imported_decl_ref);
713 lto_output_var_decl_index (ob->decl_state, ob->main_stream, expr);
717 output_record_start (ob, LTO_type_decl_ref);
718 lto_output_type_decl_index (ob->decl_state, ob->main_stream, expr);
722 output_record_start (ob, LTO_namespace_decl_ref);
723 lto_output_namespace_decl_index (ob->decl_state, ob->main_stream, expr);
727 output_record_start (ob, LTO_label_decl_ref);
728 lto_output_var_decl_index (ob->decl_state, ob->main_stream, expr);
732 output_record_start (ob, LTO_result_decl_ref);
733 lto_output_var_decl_index (ob->decl_state, ob->main_stream, expr);
737 /* No other node is indexable, so it should have been handled
738 by lto_output_tree. */
744 /* If REF_P is true, emit a reference to EXPR in output block OB,
745 otherwise emit the physical representation of EXPR in OB. */
748 lto_output_tree_or_ref (struct output_block *ob, tree expr, bool ref_p)
751 lto_output_tree_ref (ob, expr);
753 lto_output_tree (ob, expr, false);
757 /* Emit the chain of tree nodes starting at T. OB is the output block
758 to write to. REF_P is true if chain elements should be emitted
762 lto_output_chain (struct output_block *ob, tree t, bool ref_p)
766 count = list_length (t);
767 output_sleb128 (ob, count);
768 for (i = 0; i < count; i++)
772 /* Clear TREE_CHAIN to avoid blindly recursing into the rest
774 saved_chain = TREE_CHAIN (t);
775 TREE_CHAIN (t) = NULL_TREE;
777 lto_output_tree_or_ref (ob, t, ref_p);
779 TREE_CHAIN (t) = saved_chain;
785 /* Write all pointer fields in the TS_COMMON structure of EXPR to output
786 block OB. If REF_P is true, write a reference to EXPR's pointer
790 lto_output_ts_common_tree_pointers (struct output_block *ob, tree expr,
793 lto_output_tree_or_ref (ob, TREE_TYPE (expr), ref_p);
797 /* Write all pointer fields in the TS_VECTOR structure of EXPR to output
798 block OB. If REF_P is true, write a reference to EXPR's pointer
802 lto_output_ts_vector_tree_pointers (struct output_block *ob, tree expr,
805 lto_output_chain (ob, TREE_VECTOR_CST_ELTS (expr), ref_p);
809 /* Write all pointer fields in the TS_COMPLEX structure of EXPR to output
810 block OB. If REF_P is true, write a reference to EXPR's pointer
814 lto_output_ts_complex_tree_pointers (struct output_block *ob, tree expr,
817 lto_output_tree_or_ref (ob, TREE_REALPART (expr), ref_p);
818 lto_output_tree_or_ref (ob, TREE_IMAGPART (expr), ref_p);
822 /* Write all pointer fields in the TS_DECL_MINIMAL structure of EXPR
823 to output block OB. If REF_P is true, write a reference to EXPR's
827 lto_output_ts_decl_minimal_tree_pointers (struct output_block *ob, tree expr,
830 lto_output_tree_or_ref (ob, DECL_NAME (expr), ref_p);
831 lto_output_tree_or_ref (ob, DECL_CONTEXT (expr), ref_p);
832 lto_output_location (ob, DECL_SOURCE_LOCATION (expr));
836 /* Write all pointer fields in the TS_DECL_COMMON structure of EXPR to
837 output block OB. If REF_P is true, write a reference to EXPR's
841 lto_output_ts_decl_common_tree_pointers (struct output_block *ob, tree expr,
844 lto_output_tree_or_ref (ob, DECL_SIZE (expr), ref_p);
845 lto_output_tree_or_ref (ob, DECL_SIZE_UNIT (expr), ref_p);
847 if (TREE_CODE (expr) != FUNCTION_DECL)
848 lto_output_tree_or_ref (ob, DECL_INITIAL (expr), ref_p);
850 lto_output_tree_or_ref (ob, DECL_ATTRIBUTES (expr), ref_p);
851 lto_output_tree_or_ref (ob, DECL_ABSTRACT_ORIGIN (expr), ref_p);
853 if (TREE_CODE (expr) == PARM_DECL)
854 lto_output_chain (ob, TREE_CHAIN (expr), ref_p);
856 if ((TREE_CODE (expr) == VAR_DECL
857 || TREE_CODE (expr) == PARM_DECL)
858 && DECL_HAS_VALUE_EXPR_P (expr))
859 lto_output_tree_or_ref (ob, DECL_VALUE_EXPR (expr), ref_p);
863 /* Write all pointer fields in the TS_DECL_NON_COMMON structure of
864 EXPR to output block OB. If REF_P is true, write a reference to EXPR's
868 lto_output_ts_decl_non_common_tree_pointers (struct output_block *ob,
869 tree expr, bool ref_p)
871 if (TREE_CODE (expr) == FUNCTION_DECL)
873 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
874 At this point, it should not exist. Either because it was
875 converted to gimple or because DECL didn't have a GENERIC
876 representation in this TU. */
877 gcc_assert (DECL_SAVED_TREE (expr) == NULL_TREE);
878 lto_output_tree_or_ref (ob, DECL_ARGUMENTS (expr), ref_p);
879 lto_output_tree_or_ref (ob, DECL_RESULT (expr), ref_p);
881 lto_output_tree_or_ref (ob, DECL_VINDEX (expr), ref_p);
885 /* Write all pointer fields in the TS_DECL_WITH_VIS structure of EXPR
886 to output block OB. If REF_P is true, write a reference to EXPR's
890 lto_output_ts_decl_with_vis_tree_pointers (struct output_block *ob, tree expr,
893 /* Make sure we don't inadvertently set the assembler name. */
894 if (DECL_ASSEMBLER_NAME_SET_P (expr))
895 lto_output_tree_or_ref (ob, DECL_ASSEMBLER_NAME (expr), ref_p);
899 lto_output_tree_or_ref (ob, DECL_SECTION_NAME (expr), ref_p);
900 lto_output_tree_or_ref (ob, DECL_COMDAT_GROUP (expr), ref_p);
904 /* Write all pointer fields in the TS_FIELD_DECL structure of EXPR to
905 output block OB. If REF_P is true, write a reference to EXPR's
909 lto_output_ts_field_decl_tree_pointers (struct output_block *ob, tree expr,
912 lto_output_tree_or_ref (ob, DECL_FIELD_OFFSET (expr), ref_p);
913 lto_output_tree_or_ref (ob, DECL_BIT_FIELD_TYPE (expr), ref_p);
914 lto_output_tree_or_ref (ob, DECL_QUALIFIER (expr), ref_p);
915 lto_output_tree_or_ref (ob, DECL_FIELD_BIT_OFFSET (expr), ref_p);
916 lto_output_tree_or_ref (ob, DECL_FCONTEXT (expr), ref_p);
917 lto_output_chain (ob, TREE_CHAIN (expr), ref_p);
921 /* Write all pointer fields in the TS_FUNCTION_DECL structure of EXPR
922 to output block OB. If REF_P is true, write a reference to EXPR's
926 lto_output_ts_function_decl_tree_pointers (struct output_block *ob, tree expr,
929 /* DECL_STRUCT_FUNCTION is handled by lto_output_function. FIXME lto,
930 maybe it should be handled here? */
931 lto_output_tree_or_ref (ob, DECL_FUNCTION_PERSONALITY (expr), ref_p);
932 lto_output_tree_or_ref (ob, DECL_FUNCTION_SPECIFIC_TARGET (expr), ref_p);
933 lto_output_tree_or_ref (ob, DECL_FUNCTION_SPECIFIC_OPTIMIZATION (expr),
938 /* Write all pointer fields in the TS_TYPE structure of EXPR to output
939 block OB. If REF_P is true, write a reference to EXPR's pointer
943 lto_output_ts_type_tree_pointers (struct output_block *ob, tree expr,
946 if (TREE_CODE (expr) == ENUMERAL_TYPE)
947 lto_output_tree_or_ref (ob, TYPE_VALUES (expr), ref_p);
948 else if (TREE_CODE (expr) == ARRAY_TYPE)
949 lto_output_tree_or_ref (ob, TYPE_DOMAIN (expr), ref_p);
950 else if (RECORD_OR_UNION_TYPE_P (expr))
951 lto_output_tree_or_ref (ob, TYPE_FIELDS (expr), ref_p);
952 else if (TREE_CODE (expr) == FUNCTION_TYPE
953 || TREE_CODE (expr) == METHOD_TYPE)
954 lto_output_tree_or_ref (ob, TYPE_ARG_TYPES (expr), ref_p);
955 else if (TREE_CODE (expr) == VECTOR_TYPE)
956 lto_output_tree_or_ref (ob, TYPE_DEBUG_REPRESENTATION_TYPE (expr), ref_p);
958 lto_output_tree_or_ref (ob, TYPE_SIZE (expr), ref_p);
959 lto_output_tree_or_ref (ob, TYPE_SIZE_UNIT (expr), ref_p);
960 lto_output_tree_or_ref (ob, TYPE_ATTRIBUTES (expr), ref_p);
961 lto_output_tree_or_ref (ob, TYPE_NAME (expr), ref_p);
962 /* Do not stream TYPE_POINTER_TO or TYPE_REFERENCE_TO nor
963 TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. */
964 if (!POINTER_TYPE_P (expr))
965 lto_output_tree_or_ref (ob, TYPE_MINVAL (expr), ref_p);
966 lto_output_tree_or_ref (ob, TYPE_MAXVAL (expr), ref_p);
967 lto_output_tree_or_ref (ob, TYPE_MAIN_VARIANT (expr), ref_p);
968 /* Do not stream TYPE_NEXT_VARIANT, we reconstruct the variant lists
970 if (RECORD_OR_UNION_TYPE_P (expr))
971 lto_output_tree_or_ref (ob, TYPE_BINFO (expr), ref_p);
972 lto_output_tree_or_ref (ob, TYPE_CONTEXT (expr), ref_p);
973 lto_output_tree_or_ref (ob, TYPE_CANONICAL (expr), ref_p);
974 lto_output_tree_or_ref (ob, TYPE_STUB_DECL (expr), ref_p);
978 /* Write all pointer fields in the TS_LIST structure of EXPR to output
979 block OB. If REF_P is true, write a reference to EXPR's pointer
983 lto_output_ts_list_tree_pointers (struct output_block *ob, tree expr,
986 lto_output_tree_or_ref (ob, TREE_PURPOSE (expr), ref_p);
987 lto_output_tree_or_ref (ob, TREE_VALUE (expr), ref_p);
988 lto_output_chain (ob, TREE_CHAIN (expr), ref_p);
992 /* Write all pointer fields in the TS_VEC structure of EXPR to output
993 block OB. If REF_P is true, write a reference to EXPR's pointer
997 lto_output_ts_vec_tree_pointers (struct output_block *ob, tree expr, bool ref_p)
1001 /* Note that the number of slots for EXPR has already been emitted
1002 in EXPR's header (see lto_output_tree_header). */
1003 for (i = 0; i < TREE_VEC_LENGTH (expr); i++)
1004 lto_output_tree_or_ref (ob, TREE_VEC_ELT (expr, i), ref_p);
1008 /* Write all pointer fields in the TS_EXP structure of EXPR to output
1009 block OB. If REF_P is true, write a reference to EXPR's pointer
1013 lto_output_ts_exp_tree_pointers (struct output_block *ob, tree expr, bool ref_p)
1017 output_sleb128 (ob, TREE_OPERAND_LENGTH (expr));
1018 for (i = 0; i < TREE_OPERAND_LENGTH (expr); i++)
1019 lto_output_tree_or_ref (ob, TREE_OPERAND (expr, i), ref_p);
1020 lto_output_location (ob, EXPR_LOCATION (expr));
1021 lto_output_tree_or_ref (ob, TREE_BLOCK (expr), ref_p);
1025 /* Write all pointer fields in the TS_BLOCK structure of EXPR to output
1026 block OB. If REF_P is true, write a reference to EXPR's pointer
1030 lto_output_ts_block_tree_pointers (struct output_block *ob, tree expr,
1036 lto_output_location (ob, BLOCK_SOURCE_LOCATION (expr));
1037 lto_output_chain (ob, BLOCK_VARS (expr), ref_p);
1039 output_uleb128 (ob, VEC_length (tree, BLOCK_NONLOCALIZED_VARS (expr)));
1040 for (i = 0; VEC_iterate (tree, BLOCK_NONLOCALIZED_VARS (expr), i, t); i++)
1041 lto_output_tree_or_ref (ob, t, ref_p);
1043 lto_output_tree_or_ref (ob, BLOCK_SUPERCONTEXT (expr), ref_p);
1044 lto_output_tree_or_ref (ob, BLOCK_ABSTRACT_ORIGIN (expr), ref_p);
1045 lto_output_tree_or_ref (ob, BLOCK_FRAGMENT_ORIGIN (expr), ref_p);
1046 lto_output_tree_or_ref (ob, BLOCK_FRAGMENT_CHAIN (expr), ref_p);
1047 lto_output_chain (ob, BLOCK_SUBBLOCKS (expr), ref_p);
1051 /* Write all pointer fields in the TS_BINFO structure of EXPR to output
1052 block OB. If REF_P is true, write a reference to EXPR's pointer
1056 lto_output_ts_binfo_tree_pointers (struct output_block *ob, tree expr,
1062 /* Note that the number of BINFO slots has already been emitted in
1063 EXPR's header (see lto_output_tree_header) because this length
1064 is needed to build the empty BINFO node on the reader side. */
1065 for (i = 0; VEC_iterate (tree, BINFO_BASE_BINFOS (expr), i, t); i++)
1066 lto_output_tree_or_ref (ob, t, ref_p);
1069 lto_output_tree_or_ref (ob, BINFO_OFFSET (expr), ref_p);
1070 lto_output_tree_or_ref (ob, BINFO_VTABLE (expr), ref_p);
1071 lto_output_tree_or_ref (ob, BINFO_VIRTUALS (expr), ref_p);
1072 lto_output_tree_or_ref (ob, BINFO_VPTR_FIELD (expr), ref_p);
1074 output_uleb128 (ob, VEC_length (tree, BINFO_BASE_ACCESSES (expr)));
1075 for (i = 0; VEC_iterate (tree, BINFO_BASE_ACCESSES (expr), i, t); i++)
1076 lto_output_tree_or_ref (ob, t, ref_p);
1078 lto_output_tree_or_ref (ob, BINFO_INHERITANCE_CHAIN (expr), ref_p);
1079 lto_output_tree_or_ref (ob, BINFO_SUBVTT_INDEX (expr), ref_p);
1080 lto_output_tree_or_ref (ob, BINFO_VPTR_INDEX (expr), ref_p);
1084 /* Write all pointer fields in the TS_CONSTRUCTOR structure of EXPR to
1085 output block OB. If REF_P is true, write a reference to EXPR's
1089 lto_output_ts_constructor_tree_pointers (struct output_block *ob, tree expr,
1095 output_uleb128 (ob, CONSTRUCTOR_NELTS (expr));
1096 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (expr), i, index, value)
1098 lto_output_tree_or_ref (ob, index, ref_p);
1099 lto_output_tree_or_ref (ob, value, ref_p);
1104 /* Helper for lto_output_tree. Write all pointer fields in EXPR to output
1105 block OB. If REF_P is true, the leaves of EXPR are emitted as
1109 lto_output_tree_pointers (struct output_block *ob, tree expr, bool ref_p)
1111 enum tree_code code;
1113 code = TREE_CODE (expr);
1115 if (CODE_CONTAINS_STRUCT (code, TS_COMMON))
1116 lto_output_ts_common_tree_pointers (ob, expr, ref_p);
1118 if (CODE_CONTAINS_STRUCT (code, TS_VECTOR))
1119 lto_output_ts_vector_tree_pointers (ob, expr, ref_p);
1121 if (CODE_CONTAINS_STRUCT (code, TS_COMPLEX))
1122 lto_output_ts_complex_tree_pointers (ob, expr, ref_p);
1124 if (CODE_CONTAINS_STRUCT (code, TS_DECL_MINIMAL))
1125 lto_output_ts_decl_minimal_tree_pointers (ob, expr, ref_p);
1127 if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
1128 lto_output_ts_decl_common_tree_pointers (ob, expr, ref_p);
1130 if (CODE_CONTAINS_STRUCT (code, TS_DECL_NON_COMMON))
1131 lto_output_ts_decl_non_common_tree_pointers (ob, expr, ref_p);
1133 if (CODE_CONTAINS_STRUCT (code, TS_DECL_WITH_VIS))
1134 lto_output_ts_decl_with_vis_tree_pointers (ob, expr, ref_p);
1136 if (CODE_CONTAINS_STRUCT (code, TS_FIELD_DECL))
1137 lto_output_ts_field_decl_tree_pointers (ob, expr, ref_p);
1139 if (CODE_CONTAINS_STRUCT (code, TS_FUNCTION_DECL))
1140 lto_output_ts_function_decl_tree_pointers (ob, expr, ref_p);
1142 if (CODE_CONTAINS_STRUCT (code, TS_TYPE))
1143 lto_output_ts_type_tree_pointers (ob, expr, ref_p);
1145 if (CODE_CONTAINS_STRUCT (code, TS_LIST))
1146 lto_output_ts_list_tree_pointers (ob, expr, ref_p);
1148 if (CODE_CONTAINS_STRUCT (code, TS_VEC))
1149 lto_output_ts_vec_tree_pointers (ob, expr, ref_p);
1151 if (CODE_CONTAINS_STRUCT (code, TS_EXP))
1152 lto_output_ts_exp_tree_pointers (ob, expr, ref_p);
1154 if (CODE_CONTAINS_STRUCT (code, TS_SSA_NAME))
1156 /* We only stream the version number of SSA names. */
1160 if (CODE_CONTAINS_STRUCT (code, TS_BLOCK))
1161 lto_output_ts_block_tree_pointers (ob, expr, ref_p);
1163 if (CODE_CONTAINS_STRUCT (code, TS_BINFO))
1164 lto_output_ts_binfo_tree_pointers (ob, expr, ref_p);
1166 if (CODE_CONTAINS_STRUCT (code, TS_CONSTRUCTOR))
1167 lto_output_ts_constructor_tree_pointers (ob, expr, ref_p);
1169 if (CODE_CONTAINS_STRUCT (code, TS_STATEMENT_LIST))
1171 /* This should only appear in GENERIC. */
1175 if (CODE_CONTAINS_STRUCT (code, TS_OMP_CLAUSE))
1177 /* This should only appear in High GIMPLE. */
1181 if (CODE_CONTAINS_STRUCT (code, TS_OPTIMIZATION))
1182 sorry ("gimple bytecode streams do not support the optimization attribute");
1184 if (CODE_CONTAINS_STRUCT (code, TS_TARGET_OPTION))
1185 sorry ("gimple bytecode streams do not support the target attribute");
1189 /* Emit header information for tree EXPR to output block OB. The header
1190 contains everything needed to instantiate an empty skeleton for
1191 EXPR on the reading side. IX is the index into the streamer cache
1192 where EXPR is stored. REF_P is as in lto_output_tree. */
1195 lto_output_tree_header (struct output_block *ob, tree expr, int ix)
1198 enum tree_code code;
1200 /* We should not see any non-GIMPLE tree nodes here. */
1201 code = TREE_CODE (expr);
1202 if (!lto_is_streamable (expr))
1203 internal_error ("tree code %qs is not supported in gimple streams",
1204 tree_code_name[code]);
1206 /* The header of a tree node consists of its tag, the size of
1207 the node, and any other information needed to instantiate
1208 EXPR on the reading side (such as the number of slots in
1209 variable sized nodes). */
1210 tag = lto_tree_code_to_tag (code);
1211 output_record_start (ob, tag);
1212 output_sleb128 (ob, ix);
1214 /* The following will cause bootstrap miscomparisons. Enable with care. */
1215 #ifdef LTO_STREAMER_DEBUG
1216 /* This is used mainly for debugging purposes. When the reader
1217 and the writer do not agree on a streamed node, the pointer
1218 value for EXPR can be used to track down the differences in
1220 gcc_assert ((HOST_WIDEST_INT) (intptr_t) expr == (intptr_t) expr);
1221 output_sleb128 (ob, (HOST_WIDEST_INT) (intptr_t) expr);
1224 /* The text in strings and identifiers are completely emitted in
1226 if (CODE_CONTAINS_STRUCT (code, TS_STRING))
1227 output_string_cst (ob, ob->main_stream, expr);
1228 else if (CODE_CONTAINS_STRUCT (code, TS_IDENTIFIER))
1229 output_identifier (ob, ob->main_stream, expr);
1230 else if (CODE_CONTAINS_STRUCT (code, TS_VEC))
1231 output_sleb128 (ob, TREE_VEC_LENGTH (expr));
1232 else if (CODE_CONTAINS_STRUCT (code, TS_BINFO))
1233 output_uleb128 (ob, BINFO_N_BASE_BINFOS (expr));
1237 /* Write the code and class of builtin EXPR to output block OB. IX is
1238 the index into the streamer cache where EXPR is stored.*/
1241 lto_output_builtin_tree (struct output_block *ob, tree expr, int ix)
1243 gcc_assert (lto_stream_as_builtin_p (expr));
1245 if (DECL_BUILT_IN_CLASS (expr) == BUILT_IN_MD
1246 && !targetm.builtin_decl)
1247 sorry ("gimple bytecode streams do not support machine specific builtin "
1248 "functions on this target");
1250 output_record_start (ob, LTO_builtin_decl);
1251 output_uleb128 (ob, DECL_BUILT_IN_CLASS (expr));
1252 output_uleb128 (ob, DECL_FUNCTION_CODE (expr));
1253 output_sleb128 (ob, ix);
1255 if (DECL_ASSEMBLER_NAME_SET_P (expr))
1257 /* When the assembler name of a builtin gets a user name,
1258 the new name is always prefixed with '*' by
1259 set_builtin_user_assembler_name. So, to prevent the
1260 reader side from adding a second '*', we omit it here. */
1261 const char *str = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (expr));
1262 if (strlen (str) > 1 && str[0] == '*')
1263 output_string (ob, ob->main_stream, &str[1]);
1265 output_string (ob, ob->main_stream, NULL);
1268 output_string (ob, ob->main_stream, NULL);
1272 /* Write a physical representation of tree node EXPR to output block
1273 OB. If REF_P is true, the leaves of EXPR are emitted as references
1274 via lto_output_tree_ref. IX is the index into the streamer cache
1275 where EXPR is stored. */
1278 lto_write_tree (struct output_block *ob, tree expr, bool ref_p, int ix)
1280 struct bitpack_d *bp;
1282 /* Write the header, containing everything needed to materialize
1283 EXPR on the reading side. */
1284 lto_output_tree_header (ob, expr, ix);
1286 /* Pack all the non-pointer fields in EXPR into a bitpack and write
1287 the resulting bitpack. */
1288 bp = pack_value_fields (expr);
1289 lto_output_bitpack (ob->main_stream, bp);
1290 bitpack_delete (bp);
1292 /* Write all the pointer fields in EXPR. */
1293 lto_output_tree_pointers (ob, expr, ref_p);
1295 /* Mark the end of EXPR. */
1300 /* Emit the integer constant CST to output block OB. If REF_P is true,
1301 CST's type will be emitted as a reference. */
1304 lto_output_integer_cst (struct output_block *ob, tree cst, bool ref_p)
1306 output_record_start (ob, lto_tree_code_to_tag (INTEGER_CST));
1307 lto_output_tree_or_ref (ob, TREE_TYPE (cst), ref_p);
1308 lto_output_1_stream (ob->main_stream, TREE_OVERFLOW_P (cst));
1309 output_uleb128 (ob, TREE_INT_CST_LOW (cst));
1310 output_uleb128 (ob, TREE_INT_CST_HIGH (cst));
1314 /* Emit the physical representation of tree node EXPR to output block
1315 OB. If REF_P is true, the leaves of EXPR are emitted as references
1316 via lto_output_tree_ref. */
1319 lto_output_tree (struct output_block *ob, tree expr, bool ref_p)
1325 if (expr == NULL_TREE)
1331 /* INTEGER_CST nodes are special because they need their original type
1332 to be materialized by the reader (to implement TYPE_CACHED_VALUES). */
1333 if (TREE_CODE (expr) == INTEGER_CST)
1335 lto_output_integer_cst (ob, expr, ref_p);
1339 /* Determine the offset in the stream where EXPR will be written.
1340 This is used when emitting pickle references so the reader knows
1341 where to reconstruct the pickled object from. This allows
1342 circular and forward references within the same stream. */
1343 offset = ob->main_stream->total_size;
1345 existed_p = lto_streamer_cache_insert (ob->writer_cache, expr, &ix, &offset);
1348 /* If a node has already been streamed out, make sure that
1349 we don't write it more than once. Otherwise, the reader
1350 will instantiate two different nodes for the same object. */
1351 output_record_start (ob, LTO_tree_pickle_reference);
1352 output_sleb128 (ob, ix);
1353 output_uleb128 (ob, lto_tree_code_to_tag (TREE_CODE (expr)));
1354 output_uleb128 (ob, offset);
1356 else if (lto_stream_as_builtin_p (expr))
1358 /* MD and NORMAL builtins do not need to be written out
1359 completely as they are always instantiated by the
1360 compiler on startup. The only builtins that need to
1361 be written out are BUILT_IN_FRONTEND. For all other
1362 builtins, we simply write the class and code. */
1363 lto_output_builtin_tree (ob, expr, ix);
1367 /* This is the first time we see EXPR, write its fields
1369 lto_write_tree (ob, expr, ref_p, ix);
1374 /* Output to OB a list of try/catch handlers starting with FIRST. */
1377 output_eh_try_list (struct output_block *ob, eh_catch first)
1381 for (n = first; n; n = n->next_catch)
1383 output_record_start (ob, LTO_eh_catch);
1384 lto_output_tree_ref (ob, n->type_list);
1385 lto_output_tree_ref (ob, n->filter_list);
1386 lto_output_tree_ref (ob, n->label);
1393 /* Output EH region R in function FN to OB. CURR_RN is the slot index
1394 that is being emitted in FN->EH->REGION_ARRAY. This is used to
1395 detect EH region sharing. */
1398 output_eh_region (struct output_block *ob, eh_region r)
1408 if (r->type == ERT_CLEANUP)
1409 tag = LTO_ert_cleanup;
1410 else if (r->type == ERT_TRY)
1412 else if (r->type == ERT_ALLOWED_EXCEPTIONS)
1413 tag = LTO_ert_allowed_exceptions;
1414 else if (r->type == ERT_MUST_NOT_THROW)
1415 tag = LTO_ert_must_not_throw;
1419 output_record_start (ob, tag);
1420 output_sleb128 (ob, r->index);
1423 output_sleb128 (ob, r->outer->index);
1428 output_sleb128 (ob, r->inner->index);
1433 output_sleb128 (ob, r->next_peer->index);
1437 if (r->type == ERT_TRY)
1439 output_eh_try_list (ob, r->u.eh_try.first_catch);
1441 else if (r->type == ERT_ALLOWED_EXCEPTIONS)
1443 lto_output_tree_ref (ob, r->u.allowed.type_list);
1444 lto_output_tree_ref (ob, r->u.allowed.label);
1445 output_uleb128 (ob, r->u.allowed.filter);
1447 else if (r->type == ERT_MUST_NOT_THROW)
1449 lto_output_tree_ref (ob, r->u.must_not_throw.failure_decl);
1450 lto_output_location (ob, r->u.must_not_throw.failure_loc);
1453 if (r->landing_pads)
1454 output_sleb128 (ob, r->landing_pads->index);
1460 /* Output landing pad LP to OB. */
1463 output_eh_lp (struct output_block *ob, eh_landing_pad lp)
1471 output_record_start (ob, LTO_eh_landing_pad);
1472 output_sleb128 (ob, lp->index);
1474 output_sleb128 (ob, lp->next_lp->index);
1479 output_sleb128 (ob, lp->region->index);
1483 lto_output_tree_ref (ob, lp->post_landing_pad);
1487 /* Output the existing eh_table to OB. */
1490 output_eh_regions (struct output_block *ob, struct function *fn)
1492 if (fn->eh && fn->eh->region_tree)
1499 output_record_start (ob, LTO_eh_table);
1501 /* Emit the index of the root of the EH region tree. */
1502 output_sleb128 (ob, fn->eh->region_tree->index);
1504 /* Emit all the EH regions in the region array. */
1505 output_sleb128 (ob, VEC_length (eh_region, fn->eh->region_array));
1506 for (i = 0; VEC_iterate (eh_region, fn->eh->region_array, i, eh); i++)
1507 output_eh_region (ob, eh);
1509 /* Emit all landing pads. */
1510 output_sleb128 (ob, VEC_length (eh_landing_pad, fn->eh->lp_array));
1511 for (i = 0; VEC_iterate (eh_landing_pad, fn->eh->lp_array, i, lp); i++)
1512 output_eh_lp (ob, lp);
1514 /* Emit all the runtime type data. */
1515 output_sleb128 (ob, VEC_length (tree, fn->eh->ttype_data));
1516 for (i = 0; VEC_iterate (tree, fn->eh->ttype_data, i, ttype); i++)
1517 lto_output_tree_ref (ob, ttype);
1519 /* Emit the table of action chains. */
1520 if (targetm.arm_eabi_unwinder)
1523 output_sleb128 (ob, VEC_length (tree, fn->eh->ehspec_data.arm_eabi));
1525 VEC_iterate (tree, fn->eh->ehspec_data.arm_eabi, i, t);
1527 lto_output_tree_ref (ob, t);
1532 output_sleb128 (ob, VEC_length (uchar, fn->eh->ehspec_data.other));
1533 for (i = 0; VEC_iterate (uchar, fn->eh->ehspec_data.other, i, c); i++)
1534 lto_output_1_stream (ob->main_stream, c);
1538 /* The 0 either terminates the record or indicates that there are no
1539 eh_records at all. */
1544 /* Output all of the active ssa names to the ssa_names stream. */
1547 output_ssa_names (struct output_block *ob, struct function *fn)
1549 unsigned int i, len;
1551 len = VEC_length (tree, SSANAMES (fn));
1552 output_uleb128 (ob, len);
1554 for (i = 1; i < len; i++)
1556 tree ptr = VEC_index (tree, SSANAMES (fn), i);
1558 if (ptr == NULL_TREE
1559 || SSA_NAME_IN_FREE_LIST (ptr)
1560 || !is_gimple_reg (ptr))
1563 output_uleb128 (ob, i);
1564 lto_output_1_stream (ob->main_stream, SSA_NAME_IS_DEFAULT_DEF (ptr));
1565 lto_output_tree_ref (ob, SSA_NAME_VAR (ptr));
1572 /* Output the cfg. */
1575 output_cfg (struct output_block *ob, struct function *fn)
1577 struct lto_output_stream *tmp_stream = ob->main_stream;
1580 ob->main_stream = ob->cfg_stream;
1582 output_uleb128 (ob, profile_status_for_function (fn));
1584 /* Output the number of the highest basic block. */
1585 output_uleb128 (ob, last_basic_block_for_function (fn));
1587 FOR_ALL_BB_FN (bb, fn)
1592 output_sleb128 (ob, bb->index);
1594 /* Output the successors and the edge flags. */
1595 output_uleb128 (ob, EDGE_COUNT (bb->succs));
1596 FOR_EACH_EDGE (e, ei, bb->succs)
1598 output_uleb128 (ob, e->dest->index);
1599 output_sleb128 (ob, e->probability);
1600 output_sleb128 (ob, e->count);
1601 output_uleb128 (ob, e->flags);
1605 output_sleb128 (ob, -1);
1607 bb = ENTRY_BLOCK_PTR;
1610 output_sleb128 (ob, bb->next_bb->index);
1614 output_sleb128 (ob, -1);
1616 ob->main_stream = tmp_stream;
1620 /* Output PHI function PHI to the main stream in OB. */
1623 output_phi (struct output_block *ob, gimple phi)
1625 unsigned i, len = gimple_phi_num_args (phi);
1627 output_record_start (ob, lto_gimple_code_to_tag (GIMPLE_PHI));
1628 output_uleb128 (ob, SSA_NAME_VERSION (PHI_RESULT (phi)));
1630 for (i = 0; i < len; i++)
1632 lto_output_tree_ref (ob, gimple_phi_arg_def (phi, i));
1633 output_uleb128 (ob, gimple_phi_arg_edge (phi, i)->src->index);
1634 lto_output_location (ob, gimple_phi_arg_location (phi, i));
1639 /* Emit statement STMT on the main stream of output block OB. */
1642 output_gimple_stmt (struct output_block *ob, gimple stmt)
1645 enum gimple_code code;
1647 struct bitpack_d *bp;
1649 /* Emit identifying tag. */
1650 code = gimple_code (stmt);
1651 tag = lto_gimple_code_to_tag (code);
1652 output_record_start (ob, tag);
1654 /* Emit the tuple header. */
1655 bp = bitpack_create ();
1656 bp_pack_value (bp, gimple_num_ops (stmt), sizeof (unsigned) * 8);
1657 bp_pack_value (bp, gimple_no_warning_p (stmt), 1);
1658 if (is_gimple_assign (stmt))
1659 bp_pack_value (bp, gimple_assign_nontemporal_move_p (stmt), 1);
1660 bp_pack_value (bp, gimple_has_volatile_ops (stmt), 1);
1661 bp_pack_value (bp, stmt->gsbase.subcode, 16);
1662 lto_output_bitpack (ob->main_stream, bp);
1663 bitpack_delete (bp);
1665 /* Emit location information for the statement. */
1666 lto_output_location (ob, gimple_location (stmt));
1668 /* Emit the lexical block holding STMT. */
1669 lto_output_tree (ob, gimple_block (stmt), true);
1671 /* Emit the operands. */
1672 switch (gimple_code (stmt))
1675 output_sleb128 (ob, gimple_resx_region (stmt));
1678 case GIMPLE_EH_MUST_NOT_THROW:
1679 lto_output_tree_ref (ob, gimple_eh_must_not_throw_fndecl (stmt));
1682 case GIMPLE_EH_DISPATCH:
1683 output_sleb128 (ob, gimple_eh_dispatch_region (stmt));
1687 lto_output_uleb128_stream (ob->main_stream, gimple_asm_ninputs (stmt));
1688 lto_output_uleb128_stream (ob->main_stream, gimple_asm_noutputs (stmt));
1689 lto_output_uleb128_stream (ob->main_stream, gimple_asm_nclobbers (stmt));
1690 output_string (ob, ob->main_stream, gimple_asm_string (stmt));
1701 for (i = 0; i < gimple_num_ops (stmt); i++)
1703 tree op = gimple_op (stmt, i);
1704 lto_output_tree_ref (ob, op);
1709 case GIMPLE_PREDICT:
1718 /* Output a basic block BB to the main stream in OB for this FN. */
1721 output_bb (struct output_block *ob, basic_block bb, struct function *fn)
1723 gimple_stmt_iterator bsi = gsi_start_bb (bb);
1725 output_record_start (ob,
1726 (!gsi_end_p (bsi)) || phi_nodes (bb)
1730 output_uleb128 (ob, bb->index);
1731 output_sleb128 (ob, bb->count);
1732 output_sleb128 (ob, bb->loop_depth);
1733 output_sleb128 (ob, bb->frequency);
1734 output_sleb128 (ob, bb->flags);
1736 if (!gsi_end_p (bsi) || phi_nodes (bb))
1738 /* Output the statements. The list of statements is terminated
1740 for (bsi = gsi_start_bb (bb); !gsi_end_p (bsi); gsi_next (&bsi))
1743 gimple stmt = gsi_stmt (bsi);
1745 output_gimple_stmt (ob, stmt);
1747 /* Emit the EH region holding STMT. */
1748 region = lookup_stmt_eh_lp_fn (fn, stmt);
1751 output_record_start (ob, LTO_eh_region);
1752 output_sleb128 (ob, region);
1760 for (bsi = gsi_start_phis (bb); !gsi_end_p (bsi); gsi_next (&bsi))
1762 gimple phi = gsi_stmt (bsi);
1764 /* Only emit PHIs for gimple registers. PHI nodes for .MEM
1765 will be filled in on reading when the SSA form is
1767 if (is_gimple_reg (gimple_phi_result (phi)))
1768 output_phi (ob, phi);
1775 /* Create the header in the file using OB. If the section type is for
1776 a function, set FN to the decl for that function. */
1779 produce_asm (struct output_block *ob, tree fn)
1781 enum lto_section_type section_type = ob->section_type;
1782 struct lto_function_header header;
1784 struct lto_output_stream *header_stream;
1786 if (section_type == LTO_section_function_body)
1788 const char *name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (fn));
1789 section_name = lto_get_section_name (section_type, name);
1792 section_name = lto_get_section_name (section_type, NULL);
1794 lto_begin_section (section_name, !flag_wpa);
1795 free (section_name);
1797 /* The entire header is stream computed here. */
1798 memset (&header, 0, sizeof (struct lto_function_header));
1800 /* Write the header. */
1801 header.lto_header.major_version = LTO_major_version;
1802 header.lto_header.minor_version = LTO_minor_version;
1803 header.lto_header.section_type = section_type;
1805 header.compressed_size = 0;
1807 if (section_type == LTO_section_function_body)
1808 header.cfg_size = ob->cfg_stream->total_size;
1809 header.main_size = ob->main_stream->total_size;
1810 header.string_size = ob->string_stream->total_size;
1812 header_stream = XCNEW (struct lto_output_stream);
1813 lto_output_data_stream (header_stream, &header, sizeof header);
1814 lto_write_stream (header_stream);
1815 free (header_stream);
1817 /* Put all of the gimple and the string table out the asm file as a
1819 if (section_type == LTO_section_function_body)
1820 lto_write_stream (ob->cfg_stream);
1821 lto_write_stream (ob->main_stream);
1822 lto_write_stream (ob->string_stream);
1828 /* Output the body of function NODE->DECL. */
1831 output_function (struct cgraph_node *node)
1833 struct bitpack_d *bp;
1835 struct function *fn;
1837 struct output_block *ob;
1839 function = node->decl;
1840 fn = DECL_STRUCT_FUNCTION (function);
1841 ob = create_output_block (LTO_section_function_body);
1843 clear_line_info (ob);
1844 ob->cgraph_node = node;
1846 gcc_assert (current_function_decl == NULL_TREE && cfun == NULL);
1848 /* Set current_function_decl and cfun. */
1849 current_function_decl = function;
1852 /* Make string 0 be a NULL string. */
1853 lto_output_1_stream (ob->string_stream, 0);
1855 output_record_start (ob, LTO_function);
1857 /* Write all the attributes for FN. */
1858 bp = bitpack_create ();
1859 bp_pack_value (bp, fn->is_thunk, 1);
1860 bp_pack_value (bp, fn->has_local_explicit_reg_vars, 1);
1861 bp_pack_value (bp, fn->after_tree_profile, 1);
1862 bp_pack_value (bp, fn->returns_pcc_struct, 1);
1863 bp_pack_value (bp, fn->returns_struct, 1);
1864 bp_pack_value (bp, fn->always_inline_functions_inlined, 1);
1865 bp_pack_value (bp, fn->after_inlining, 1);
1866 bp_pack_value (bp, fn->dont_save_pending_sizes_p, 1);
1867 bp_pack_value (bp, fn->stdarg, 1);
1868 bp_pack_value (bp, fn->has_nonlocal_label, 1);
1869 bp_pack_value (bp, fn->calls_alloca, 1);
1870 bp_pack_value (bp, fn->calls_setjmp, 1);
1871 bp_pack_value (bp, fn->va_list_fpr_size, 8);
1872 bp_pack_value (bp, fn->va_list_gpr_size, 8);
1873 lto_output_bitpack (ob->main_stream, bp);
1874 bitpack_delete (bp);
1876 /* Output current IL state of the function. */
1877 output_uleb128 (ob, fn->curr_properties);
1879 /* Output the static chain and non-local goto save area. */
1880 lto_output_tree_ref (ob, fn->static_chain_decl);
1881 lto_output_tree_ref (ob, fn->nonlocal_goto_save_area);
1883 /* Output all the local variables in the function. */
1884 lto_output_tree_ref (ob, fn->local_decls);
1886 /* Output the head of the arguments list. */
1887 lto_output_tree_ref (ob, DECL_ARGUMENTS (function));
1889 /* Output all the SSA names used in the function. */
1890 output_ssa_names (ob, fn);
1892 /* Output any exception handling regions. */
1893 output_eh_regions (ob, fn);
1895 /* Output DECL_INITIAL for the function, which contains the tree of
1897 lto_output_tree (ob, DECL_INITIAL (function), true);
1899 /* We will renumber the statements. The code that does this uses
1900 the same ordering that we use for serializing them so we can use
1901 the same code on the other end and not have to write out the
1902 statement numbers. */
1903 renumber_gimple_stmt_uids ();
1905 /* Output the code for the function. */
1906 FOR_ALL_BB_FN (bb, fn)
1907 output_bb (ob, bb, fn);
1909 /* The terminator for this function. */
1912 output_cfg (ob, fn);
1914 /* Create a section to hold the pickled output of this function. */
1915 produce_asm (ob, function);
1917 destroy_output_block (ob);
1919 current_function_decl = NULL;
1924 /* Return true if alias pair P belongs to the set of cgraph nodes in
1925 SET. If P is a an alias for a VAR_DECL, it can always be emitted.
1926 However, for FUNCTION_DECL aliases, we should only output the pair
1927 if it belongs to a function whose cgraph node is in SET.
1928 Otherwise, the LTRANS phase will get into trouble when finalizing
1929 aliases because the alias will refer to a function not defined in
1930 the file processed by LTRANS. */
1933 output_alias_pair_p (alias_pair *p, cgraph_node_set set)
1935 cgraph_node_set_iterator csi;
1936 struct cgraph_node *target_node;
1938 /* Always emit VAR_DECLs. FIXME lto, we should probably only emit
1939 those VAR_DECLs that are instantiated in this file partition, but
1940 we have no easy way of knowing this based on SET. */
1941 if (TREE_CODE (p->decl) == VAR_DECL)
1944 /* Check if the assembler name for P->TARGET has its cgraph node in SET. */
1945 gcc_assert (TREE_CODE (p->decl) == FUNCTION_DECL);
1946 target_node = cgraph_node_for_asm (p->target);
1947 csi = cgraph_node_set_find (set, target_node);
1948 return (!csi_end_p (csi));
1952 /* Output any unreferenced global symbol defined in SET, alias pairs
1956 output_unreferenced_globals (cgraph_node_set set)
1958 struct output_block *ob;
1961 struct varpool_node *vnode;
1963 ob = create_output_block (LTO_section_static_initializer);
1964 ob->cgraph_node = NULL;
1966 clear_line_info (ob);
1968 /* Make string 0 be a NULL string. */
1969 lto_output_1_stream (ob->string_stream, 0);
1971 /* Emit references for all the global symbols. If a global symbol
1972 was never referenced in any of the functions of this file, it
1973 would not be emitted otherwise. This will result in unreferenced
1974 symbols at link time if a file defines a global symbol but
1975 never references it. */
1976 FOR_EACH_STATIC_VARIABLE (vnode)
1978 tree var = vnode->decl;
1980 if (TREE_CODE (var) == VAR_DECL)
1982 struct varpool_node *alias;
1984 /* Output the object in order to output references used in the
1986 lto_output_tree (ob, var, true);
1988 /* If it is public we also need a reference to the object itself. */
1989 if (TREE_PUBLIC (var))
1990 lto_output_tree_ref (ob, var);
1992 /* Also output any extra_name aliases for this variable. */
1993 for (alias = vnode->extra_name; alias; alias = alias->next)
1995 lto_output_tree (ob, alias->decl, true);
1996 output_record_start (ob, LTO_var_decl_alias);
1997 lto_output_var_decl_index (ob->decl_state, ob->main_stream,
1999 lto_output_var_decl_index (ob->decl_state, ob->main_stream,
2007 /* Emit the alias pairs for the nodes in SET. */
2008 for (i = 0; VEC_iterate (alias_pair, alias_pairs, i, p); i++)
2010 if (output_alias_pair_p (p, set))
2012 lto_output_tree_ref (ob, p->decl);
2013 lto_output_tree_ref (ob, p->target);
2019 produce_asm (ob, NULL);
2020 destroy_output_block (ob);
2024 /* Copy the function body of NODE without deserializing. */
2027 copy_function (struct cgraph_node *node)
2029 tree function = node->decl;
2030 struct lto_file_decl_data *file_data = node->local.lto_file_data;
2031 struct lto_output_stream *output_stream = XCNEW (struct lto_output_stream);
2034 const char *name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (function));
2035 char *section_name =
2036 lto_get_section_name (LTO_section_function_body, name);
2038 struct lto_in_decl_state *in_state;
2039 struct lto_out_decl_state *out_state = lto_get_out_decl_state ();
2041 lto_begin_section (section_name, !flag_wpa);
2042 free (section_name);
2044 /* We may have renamed the declaration, e.g., a static function. */
2045 name = lto_get_decl_name_mapping (file_data, name);
2047 data = lto_get_section_data (file_data, LTO_section_function_body,
2051 /* Do a bit copy of the function body. */
2052 lto_output_data_stream (output_stream, data, len);
2053 lto_write_stream (output_stream);
2057 lto_get_function_in_decl_state (node->local.lto_file_data, function);
2058 gcc_assert (in_state);
2060 for (i = 0; i < LTO_N_DECL_STREAMS; i++)
2062 size_t n = in_state->streams[i].size;
2063 tree *trees = in_state->streams[i].trees;
2064 struct lto_tree_ref_encoder *encoder = &(out_state->streams[i]);
2066 /* The out state must have the same indices and the in state.
2067 So just copy the vector. All the encoders in the in state
2068 must be empty where we reach here. */
2069 gcc_assert (lto_tree_ref_encoder_size (encoder) == 0);
2070 for (j = 0; j < n; j++)
2071 VEC_safe_push (tree, heap, encoder->trees, trees[j]);
2072 encoder->next_index = n;
2075 lto_free_section_data (file_data, LTO_section_function_body, name,
2077 free (output_stream);
2082 /* Initialize the LTO writer. */
2085 lto_writer_init (void)
2087 lto_streamer_init ();
2091 /* Main entry point from the pass manager. */
2094 lto_output (cgraph_node_set set)
2096 struct cgraph_node *node;
2097 struct lto_out_decl_state *decl_state;
2098 cgraph_node_set_iterator csi;
2099 bitmap output = lto_bitmap_alloc ();
2103 /* Process only the functions with bodies. */
2104 for (csi = csi_start (set); !csi_end_p (csi); csi_next (&csi))
2106 node = csi_node (csi);
2107 if (node->analyzed && !bitmap_bit_p (output, DECL_UID (node->decl)))
2109 bitmap_set_bit (output, DECL_UID (node->decl));
2110 decl_state = lto_new_out_decl_state ();
2111 lto_push_out_decl_state (decl_state);
2113 output_function (node);
2115 copy_function (node);
2116 gcc_assert (lto_get_out_decl_state () == decl_state);
2117 lto_pop_out_decl_state ();
2118 lto_record_function_out_decl_state (node->decl, decl_state);
2122 /* Emit the callgraph after emitting function bodies. This needs to
2123 be done now to make sure that all the statements in every function
2124 have been renumbered so that edges can be associated with call
2125 statements using the statement UIDs. */
2126 output_cgraph (set);
2128 lto_bitmap_free (output);
2131 struct ipa_opt_pass_d pass_ipa_lto_gimple_out =
2135 "lto_gimple_out", /* name */
2136 gate_lto_out, /* gate */
2140 0, /* static_pass_number */
2141 TV_IPA_LTO_GIMPLE_IO, /* tv_id */
2142 0, /* properties_required */
2143 0, /* properties_provided */
2144 0, /* properties_destroyed */
2145 0, /* todo_flags_start */
2146 TODO_dump_func /* todo_flags_finish */
2148 NULL, /* generate_summary */
2149 lto_output, /* write_summary */
2150 NULL, /* read_summary */
2151 lto_output, /* write_optimization_summary */
2152 NULL, /* read_optimization_summary */
2153 NULL, /* stmt_fixup */
2155 NULL, /* function_transform */
2156 NULL /* variable_transform */
2160 /* Write each node in encoded by ENCODER to OB, as well as those reachable
2161 from it and required for correct representation of its semantics.
2162 Each node in ENCODER must be a global declaration or a type. A node
2163 is written only once, even if it appears multiple times in the
2164 vector. Certain transitively-reachable nodes, such as those
2165 representing expressions, may be duplicated, but such nodes
2166 must not appear in ENCODER itself. */
2169 write_global_stream (struct output_block *ob,
2170 struct lto_tree_ref_encoder *encoder)
2174 const size_t size = lto_tree_ref_encoder_size (encoder);
2176 for (index = 0; index < size; index++)
2178 t = lto_tree_ref_encoder_get_tree (encoder, index);
2179 if (!lto_streamer_cache_lookup (ob->writer_cache, t, NULL))
2180 lto_output_tree (ob, t, false);
2184 /* In WPA we should not emit multiple definitions of the
2185 same symbol to all the files in the link set. If
2186 T had already been emitted as the pervailing definition
2187 in one file, do not emit it in the others. */
2188 /* FIXME lto. We should check if T belongs to the
2189 file we are writing to. */
2190 if (TREE_CODE (t) == VAR_DECL
2192 && !DECL_EXTERNAL (t))
2193 TREE_ASM_WRITTEN (t) = 1;
2199 /* Write a sequence of indices into the globals vector corresponding
2200 to the trees in ENCODER. These are used by the reader to map the
2201 indices used to refer to global entities within function bodies to
2205 write_global_references (struct output_block *ob,
2206 struct lto_output_stream *ref_stream,
2207 struct lto_tree_ref_encoder *encoder)
2211 const int32_t size = lto_tree_ref_encoder_size (encoder);
2213 /* Write size as 32-bit unsigned. */
2214 lto_output_data_stream (ref_stream, &size, sizeof (int32_t));
2216 for (index = 0; index < size; index++)
2220 t = lto_tree_ref_encoder_get_tree (encoder, index);
2221 lto_streamer_cache_lookup (ob->writer_cache, t, &slot_num);
2222 gcc_assert (slot_num >= 0);
2223 lto_output_data_stream (ref_stream, &slot_num, sizeof slot_num);
2228 /* Write all the streams in an lto_out_decl_state STATE using
2229 output block OB and output stream OUT_STREAM. */
2232 lto_output_decl_state_streams (struct output_block *ob,
2233 struct lto_out_decl_state *state)
2237 for (i = 0; i < LTO_N_DECL_STREAMS; i++)
2238 write_global_stream (ob, &state->streams[i]);
2242 /* Write all the references in an lto_out_decl_state STATE using
2243 output block OB and output stream OUT_STREAM. */
2246 lto_output_decl_state_refs (struct output_block *ob,
2247 struct lto_output_stream *out_stream,
2248 struct lto_out_decl_state *state)
2254 /* Write reference to FUNCTION_DECL. If there is not function,
2255 write reference to void_type_node. */
2256 decl = (state->fn_decl) ? state->fn_decl : void_type_node;
2257 lto_streamer_cache_lookup (ob->writer_cache, decl, &ref);
2258 gcc_assert (ref >= 0);
2259 lto_output_data_stream (out_stream, &ref, sizeof (int32_t));
2261 for (i = 0; i < LTO_N_DECL_STREAMS; i++)
2262 write_global_references (ob, out_stream, &state->streams[i]);
2266 /* Return the written size of STATE. */
2269 lto_out_decl_state_written_size (struct lto_out_decl_state *state)
2274 size = sizeof (int32_t); /* fn_ref. */
2275 for (i = 0; i < LTO_N_DECL_STREAMS; i++)
2277 size += sizeof (int32_t); /* vector size. */
2278 size += (lto_tree_ref_encoder_size (&state->streams[i])
2279 * sizeof (int32_t));
2285 /* Helper function of write_symbols_of_kind. CACHE is the streamer
2286 cache with all the pickled nodes. STREAM is the stream where to
2287 write the table. V is a vector with the DECLs that should be on
2288 the table. SEEN is a bitmap of symbols written so far. */
2291 write_symbol_vec (struct lto_streamer_cache_d *cache,
2292 struct lto_output_stream *stream,
2293 VEC(tree,heap) *v, bitmap seen)
2298 for (index = 0; VEC_iterate(tree, v, index, t); index++)
2301 enum gcc_plugin_symbol_kind kind;
2302 enum gcc_plugin_symbol_visibility visibility;
2307 /* None of the following kinds of symbols are needed in the
2309 if (!TREE_PUBLIC (t)
2310 || is_builtin_fn (t)
2311 || DECL_ABSTRACT (t)
2312 || TREE_CODE (t) == RESULT_DECL)
2315 gcc_assert (TREE_CODE (t) == VAR_DECL
2316 || TREE_CODE (t) == FUNCTION_DECL);
2318 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (t));
2320 /* FIXME lto: this is from assemble_name_raw in varasm.c. For some
2321 architectures we might have to do the same name manipulations that
2322 ASM_OUTPUT_LABELREF does. */
2326 lto_streamer_cache_lookup (cache, t, &slot_num);
2327 gcc_assert (slot_num >= 0);
2329 /* Avoid duplicate symbols. */
2330 if (bitmap_bit_p (seen, slot_num))
2333 bitmap_set_bit (seen, slot_num);
2335 if (DECL_EXTERNAL (t))
2338 kind = GCCPK_WEAKUNDEF;
2345 kind = GCCPK_WEAKDEF;
2346 else if (DECL_COMMON (t))
2347 kind = GCCPK_COMMON;
2352 switch (DECL_VISIBILITY(t))
2354 case VISIBILITY_DEFAULT:
2355 visibility = GCCPV_DEFAULT;
2357 case VISIBILITY_PROTECTED:
2358 visibility = GCCPV_PROTECTED;
2360 case VISIBILITY_HIDDEN:
2361 visibility = GCCPV_HIDDEN;
2363 case VISIBILITY_INTERNAL:
2364 visibility = GCCPV_INTERNAL;
2368 if (kind == GCCPK_COMMON
2370 && TREE_CODE (DECL_SIZE (t)) == INTEGER_CST)
2371 size = (((uint64_t) TREE_INT_CST_HIGH (DECL_SIZE (t))) << 32)
2372 | TREE_INT_CST_LOW (DECL_SIZE (t));
2376 if (DECL_ONE_ONLY (t))
2377 comdat = IDENTIFIER_POINTER (DECL_COMDAT_GROUP (t));
2381 lto_output_data_stream (stream, name, strlen (name) + 1);
2382 lto_output_data_stream (stream, comdat, strlen (comdat) + 1);
2383 lto_output_data_stream (stream, &kind, 1);
2384 lto_output_data_stream (stream, &visibility, 1);
2385 lto_output_data_stream (stream, &size, 8);
2386 lto_output_data_stream (stream, &slot_num, 4);
2391 /* Write IL symbols of KIND. CACHE is the streamer cache with all the
2392 pickled nodes. SEEN is a bitmap of symbols written so far. */
2395 write_symbols_of_kind (lto_decl_stream_e_t kind,
2396 struct lto_streamer_cache_d *cache, bitmap seen)
2398 struct lto_out_decl_state *out_state;
2399 struct lto_output_stream stream;
2401 VEC_length (lto_out_decl_state_ptr, lto_function_decl_states);
2404 memset (&stream, 0, sizeof (stream));
2405 out_state = lto_get_out_decl_state ();
2406 write_symbol_vec (cache, &stream, out_state->streams[kind].trees, seen);
2408 for (idx = 0; idx < num_fns; idx++)
2411 VEC_index (lto_out_decl_state_ptr, lto_function_decl_states, idx);
2412 write_symbol_vec (cache, &stream, out_state->streams[kind].trees, seen);
2415 lto_write_stream (&stream);
2419 /* Write an IL symbol table. CACHE is the streamer cache with all the
2423 produce_symtab (struct lto_streamer_cache_d *cache)
2425 char *section_name = lto_get_section_name (LTO_section_symtab, NULL);
2428 lto_begin_section (section_name, false);
2429 free (section_name);
2431 seen = lto_bitmap_alloc ();
2432 write_symbols_of_kind (LTO_DECL_STREAM_FN_DECL, cache, seen);
2433 write_symbols_of_kind (LTO_DECL_STREAM_VAR_DECL, cache, seen);
2434 lto_bitmap_free (seen);
2440 /* This pass is run after all of the functions are serialized and all
2441 of the IPA passes have written their serialized forms. This pass
2442 causes the vector of all of the global decls and types used from
2443 this file to be written in to a section that can then be read in to
2444 recover these on other side. */
2447 produce_asm_for_decls (cgraph_node_set set)
2449 struct lto_out_decl_state *out_state;
2450 struct lto_out_decl_state *fn_out_state;
2451 struct lto_decl_header header;
2453 struct output_block *ob;
2454 struct lto_output_stream *header_stream, *decl_state_stream;
2455 unsigned idx, num_fns;
2456 size_t decl_state_size;
2457 int32_t num_decl_states;
2459 ob = create_output_block (LTO_section_decls);
2462 /* Write out unreferenced globals, alias pairs and labels. We defer
2463 doing this until now so that we can write out only what is
2465 output_unreferenced_globals (set);
2467 memset (&header, 0, sizeof (struct lto_decl_header));
2469 section_name = lto_get_section_name (LTO_section_decls, NULL);
2470 lto_begin_section (section_name, !flag_wpa);
2471 free (section_name);
2473 /* Make string 0 be a NULL string. */
2474 lto_output_1_stream (ob->string_stream, 0);
2476 /* Write the global symbols. */
2477 out_state = lto_get_out_decl_state ();
2478 num_fns = VEC_length (lto_out_decl_state_ptr, lto_function_decl_states);
2479 lto_output_decl_state_streams (ob, out_state);
2480 for (idx = 0; idx < num_fns; idx++)
2483 VEC_index (lto_out_decl_state_ptr, lto_function_decl_states, idx);
2484 lto_output_decl_state_streams (ob, fn_out_state);
2487 header.lto_header.major_version = LTO_major_version;
2488 header.lto_header.minor_version = LTO_minor_version;
2489 header.lto_header.section_type = LTO_section_decls;
2491 /* Currently not used. This field would allow us to preallocate
2492 the globals vector, so that it need not be resized as it is extended. */
2493 header.num_nodes = -1;
2495 /* Compute the total size of all decl out states. */
2496 decl_state_size = sizeof (int32_t);
2497 decl_state_size += lto_out_decl_state_written_size (out_state);
2498 for (idx = 0; idx < num_fns; idx++)
2501 VEC_index (lto_out_decl_state_ptr, lto_function_decl_states, idx);
2502 decl_state_size += lto_out_decl_state_written_size (fn_out_state);
2504 header.decl_state_size = decl_state_size;
2506 header.main_size = ob->main_stream->total_size;
2507 header.string_size = ob->string_stream->total_size;
2509 header_stream = XCNEW (struct lto_output_stream);
2510 lto_output_data_stream (header_stream, &header, sizeof header);
2511 lto_write_stream (header_stream);
2512 free (header_stream);
2514 /* Write the main out-decl state, followed by out-decl states of
2516 decl_state_stream = ((struct lto_output_stream *)
2517 xcalloc (1, sizeof (struct lto_output_stream)));
2518 num_decl_states = num_fns + 1;
2519 lto_output_data_stream (decl_state_stream, &num_decl_states,
2520 sizeof (num_decl_states));
2521 lto_output_decl_state_refs (ob, decl_state_stream, out_state);
2522 for (idx = 0; idx < num_fns; idx++)
2525 VEC_index (lto_out_decl_state_ptr, lto_function_decl_states, idx);
2526 lto_output_decl_state_refs (ob, decl_state_stream, fn_out_state);
2528 lto_write_stream (decl_state_stream);
2529 free(decl_state_stream);
2531 lto_write_stream (ob->main_stream);
2532 lto_write_stream (ob->string_stream);
2536 /* Write the symbol table. */
2537 produce_symtab (ob->writer_cache);
2539 /* Write command line opts. */
2540 lto_write_options ();
2542 /* Deallocate memory and clean up. */
2543 lto_cgraph_encoder_delete (ob->decl_state->cgraph_node_encoder);
2544 VEC_free (lto_out_decl_state_ptr, heap, lto_function_decl_states);
2545 lto_function_decl_states = NULL;
2546 destroy_output_block (ob);
2550 struct ipa_opt_pass_d pass_ipa_lto_finish_out =
2554 "lto_decls_out", /* name */
2555 gate_lto_out, /* gate */
2559 0, /* static_pass_number */
2560 TV_IPA_LTO_DECL_IO, /* tv_id */
2561 0, /* properties_required */
2562 0, /* properties_provided */
2563 0, /* properties_destroyed */
2564 0, /* todo_flags_start */
2565 0 /* todo_flags_finish */
2567 NULL, /* generate_summary */
2568 produce_asm_for_decls, /* write_summary */
2569 NULL, /* read_summary */
2570 produce_asm_for_decls, /* write_optimization_summary */
2571 NULL, /* read_optimization_summary */
2572 NULL, /* stmt_fixup */
2574 NULL, /* function_transform */
2575 NULL /* variable_transform */