1 /* Write the GIMPLE representation to a file stream.
3 Copyright 2009 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 bp_pack_value (bp, TREE_ASM_WRITTEN (expr), 1);
346 bp_pack_value (bp, TREE_NO_WARNING (expr), 1);
347 bp_pack_value (bp, TREE_USED (expr), 1);
348 bp_pack_value (bp, TREE_NOTHROW (expr), 1);
349 bp_pack_value (bp, TREE_STATIC (expr), 1);
350 bp_pack_value (bp, TREE_PRIVATE (expr), 1);
351 bp_pack_value (bp, TREE_PROTECTED (expr), 1);
352 bp_pack_value (bp, TREE_DEPRECATED (expr), 1);
354 bp_pack_value (bp, TYPE_SATURATING (expr), 1);
355 if (TREE_CODE (expr) == SSA_NAME)
356 bp_pack_value (bp, SSA_NAME_IS_DEFAULT_DEF (expr), 1);
360 /* Pack all the non-pointer fields of the TS_REAL_CST structure of
361 expression EXPR into bitpack BP. */
364 pack_ts_real_cst_value_fields (struct bitpack_d *bp, tree expr)
369 r = TREE_REAL_CST (expr);
370 bp_pack_value (bp, r.cl, 2);
371 bp_pack_value (bp, r.decimal, 1);
372 bp_pack_value (bp, r.sign, 1);
373 bp_pack_value (bp, r.signalling, 1);
374 bp_pack_value (bp, r.canonical, 1);
375 bp_pack_value (bp, r.uexp, EXP_BITS);
376 for (i = 0; i < SIGSZ; i++)
377 bp_pack_value (bp, r.sig[i], HOST_BITS_PER_LONG);
381 /* Pack all the non-pointer fields of the TS_FIXED_CST structure of
382 expression EXPR into bitpack BP. */
385 pack_ts_fixed_cst_value_fields (struct bitpack_d *bp, tree expr)
387 struct fixed_value fv = TREE_FIXED_CST (expr);
388 bp_pack_value (bp, fv.data.low, HOST_BITS_PER_WIDE_INT);
389 bp_pack_value (bp, fv.data.high, HOST_BITS_PER_WIDE_INT);
393 /* Pack all the non-pointer fields of the TS_DECL_COMMON structure
394 of expression EXPR into bitpack BP. */
397 pack_ts_decl_common_value_fields (struct bitpack_d *bp, tree expr)
399 bp_pack_value (bp, DECL_MODE (expr), 8);
400 bp_pack_value (bp, DECL_NONLOCAL (expr), 1);
401 bp_pack_value (bp, DECL_VIRTUAL_P (expr), 1);
402 bp_pack_value (bp, DECL_IGNORED_P (expr), 1);
403 bp_pack_value (bp, DECL_ABSTRACT (expr), 1);
404 bp_pack_value (bp, DECL_ARTIFICIAL (expr), 1);
405 bp_pack_value (bp, DECL_USER_ALIGN (expr), 1);
406 bp_pack_value (bp, DECL_PRESERVE_P (expr), 1);
407 bp_pack_value (bp, DECL_DEBUG_EXPR_IS_FROM (expr), 1);
408 bp_pack_value (bp, DECL_EXTERNAL (expr), 1);
409 bp_pack_value (bp, DECL_GIMPLE_REG_P (expr), 1);
410 bp_pack_value (bp, DECL_ALIGN (expr), HOST_BITS_PER_INT);
412 if (TREE_CODE (expr) == LABEL_DECL)
414 /* Note that we do not write LABEL_DECL_UID. The reader will
415 always assume an initial value of -1 so that the
416 label_to_block_map is recreated by gimple_set_bb. */
417 bp_pack_value (bp, DECL_ERROR_ISSUED (expr), 1);
418 bp_pack_value (bp, EH_LANDING_PAD_NR (expr), HOST_BITS_PER_INT);
421 if (TREE_CODE (expr) == FIELD_DECL)
423 bp_pack_value (bp, DECL_PACKED (expr), 1);
424 bp_pack_value (bp, DECL_NONADDRESSABLE_P (expr), 1);
425 bp_pack_value (bp, DECL_OFFSET_ALIGN (expr), 8);
428 if (TREE_CODE (expr) == RESULT_DECL
429 || TREE_CODE (expr) == PARM_DECL
430 || TREE_CODE (expr) == VAR_DECL)
432 bp_pack_value (bp, DECL_BY_REFERENCE (expr), 1);
433 if (TREE_CODE (expr) == VAR_DECL
434 || TREE_CODE (expr) == PARM_DECL)
435 bp_pack_value (bp, DECL_HAS_VALUE_EXPR_P (expr), 1);
436 bp_pack_value (bp, DECL_RESTRICTED_P (expr), 1);
441 /* Pack all the non-pointer fields of the TS_DECL_WRTL structure
442 of expression EXPR into bitpack BP. */
445 pack_ts_decl_wrtl_value_fields (struct bitpack_d *bp, tree expr)
447 bp_pack_value (bp, DECL_REGISTER (expr), 1);
451 /* Pack all the non-pointer fields of the TS_DECL_WITH_VIS structure
452 of expression EXPR into bitpack BP. */
455 pack_ts_decl_with_vis_value_fields (struct bitpack_d *bp, tree expr)
457 bp_pack_value (bp, DECL_DEFER_OUTPUT (expr), 1);
458 bp_pack_value (bp, DECL_COMMON (expr), 1);
459 bp_pack_value (bp, DECL_DLLIMPORT_P (expr), 1);
460 bp_pack_value (bp, DECL_WEAK (expr), 1);
461 bp_pack_value (bp, DECL_SEEN_IN_BIND_EXPR_P (expr), 1);
462 bp_pack_value (bp, DECL_COMDAT (expr), 1);
463 bp_pack_value (bp, DECL_VISIBILITY (expr), 2);
464 bp_pack_value (bp, DECL_VISIBILITY_SPECIFIED (expr), 1);
466 if (TREE_CODE (expr) == VAR_DECL)
468 bp_pack_value (bp, DECL_HARD_REGISTER (expr), 1);
469 bp_pack_value (bp, DECL_IN_TEXT_SECTION (expr), 1);
470 bp_pack_value (bp, DECL_TLS_MODEL (expr), 3);
473 if (VAR_OR_FUNCTION_DECL_P (expr))
474 bp_pack_value (bp, DECL_INIT_PRIORITY (expr), HOST_BITS_PER_SHORT);
478 /* Pack all the non-pointer fields of the TS_FUNCTION_DECL structure
479 of expression EXPR into bitpack BP. */
482 pack_ts_function_decl_value_fields (struct bitpack_d *bp, tree expr)
484 /* For normal/md builtins we only write the class and code, so they
485 should never be handled here. */
486 gcc_assert (!lto_stream_as_builtin_p (expr));
488 bp_pack_value (bp, DECL_FUNCTION_CODE (expr), 11);
489 bp_pack_value (bp, DECL_BUILT_IN_CLASS (expr), 2);
490 bp_pack_value (bp, DECL_STATIC_CONSTRUCTOR (expr), 1);
491 bp_pack_value (bp, DECL_STATIC_DESTRUCTOR (expr), 1);
492 bp_pack_value (bp, DECL_UNINLINABLE (expr), 1);
493 bp_pack_value (bp, DECL_POSSIBLY_INLINED (expr), 1);
494 bp_pack_value (bp, DECL_IS_NOVOPS (expr), 1);
495 bp_pack_value (bp, DECL_IS_RETURNS_TWICE (expr), 1);
496 bp_pack_value (bp, DECL_IS_MALLOC (expr), 1);
497 bp_pack_value (bp, DECL_IS_OPERATOR_NEW (expr), 1);
498 bp_pack_value (bp, DECL_DECLARED_INLINE_P (expr), 1);
499 bp_pack_value (bp, DECL_STATIC_CHAIN (expr), 1);
500 bp_pack_value (bp, DECL_NO_INLINE_WARNING_P (expr), 1);
501 bp_pack_value (bp, DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (expr), 1);
502 bp_pack_value (bp, DECL_NO_LIMIT_STACK (expr), 1);
503 bp_pack_value (bp, DECL_DISREGARD_INLINE_LIMITS (expr), 1);
504 bp_pack_value (bp, DECL_PURE_P (expr), 1);
505 bp_pack_value (bp, DECL_LOOPING_CONST_OR_PURE_P (expr), 1);
509 /* Pack all the non-pointer fields of the TS_TYPE structure
510 of expression EXPR into bitpack BP. */
513 pack_ts_type_value_fields (struct bitpack_d *bp, tree expr)
515 bp_pack_value (bp, TYPE_PRECISION (expr), 9);
516 bp_pack_value (bp, TYPE_MODE (expr), 7);
517 bp_pack_value (bp, TYPE_STRING_FLAG (expr), 1);
518 bp_pack_value (bp, TYPE_NO_FORCE_BLK (expr), 1);
519 bp_pack_value (bp, TYPE_NEEDS_CONSTRUCTING(expr), 1);
520 if (TREE_CODE (expr) == UNION_TYPE)
521 bp_pack_value (bp, TYPE_TRANSPARENT_UNION (expr), 1);
522 bp_pack_value (bp, TYPE_PACKED (expr), 1);
523 bp_pack_value (bp, TYPE_RESTRICT (expr), 1);
524 bp_pack_value (bp, TYPE_CONTAINS_PLACEHOLDER_INTERNAL (expr), 2);
525 bp_pack_value (bp, TYPE_USER_ALIGN (expr), 1);
526 bp_pack_value (bp, TYPE_READONLY (expr), 1);
527 bp_pack_value (bp, TYPE_ALIGN (expr), HOST_BITS_PER_INT);
528 bp_pack_value (bp, TYPE_ALIAS_SET (expr) == 0 ? 0 : -1, HOST_BITS_PER_INT);
532 /* Pack all the non-pointer fields of the TS_BLOCK structure
533 of expression EXPR into bitpack BP. */
536 pack_ts_block_value_fields (struct bitpack_d *bp, tree expr)
538 bp_pack_value (bp, BLOCK_ABSTRACT (expr), 1);
539 bp_pack_value (bp, BLOCK_NUMBER (expr), 31);
543 /* Pack all the non-pointer fields in EXPR into a bit pack. */
545 static struct bitpack_d *
546 pack_value_fields (tree expr)
549 struct bitpack_d *bp;
551 code = TREE_CODE (expr);
552 bp = bitpack_create ();
554 /* Note that all these functions are highly sensitive to changes in
555 the types and sizes of each of the fields being packed. */
556 pack_ts_base_value_fields (bp, expr);
558 if (CODE_CONTAINS_STRUCT (code, TS_REAL_CST))
559 pack_ts_real_cst_value_fields (bp, expr);
561 if (CODE_CONTAINS_STRUCT (code, TS_FIXED_CST))
562 pack_ts_fixed_cst_value_fields (bp, expr);
564 if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
565 pack_ts_decl_common_value_fields (bp, expr);
567 if (CODE_CONTAINS_STRUCT (code, TS_DECL_WRTL))
568 pack_ts_decl_wrtl_value_fields (bp, expr);
570 if (CODE_CONTAINS_STRUCT (code, TS_DECL_WITH_VIS))
571 pack_ts_decl_with_vis_value_fields (bp, expr);
573 if (CODE_CONTAINS_STRUCT (code, TS_FUNCTION_DECL))
574 pack_ts_function_decl_value_fields (bp, expr);
576 if (CODE_CONTAINS_STRUCT (code, TS_TYPE))
577 pack_ts_type_value_fields (bp, expr);
579 if (CODE_CONTAINS_STRUCT (code, TS_BLOCK))
580 pack_ts_block_value_fields (bp, expr);
582 if (CODE_CONTAINS_STRUCT (code, TS_SSA_NAME))
584 /* We only stream the version number of SSA names. */
588 if (CODE_CONTAINS_STRUCT (code, TS_STATEMENT_LIST))
590 /* This is only used by GENERIC. */
594 if (CODE_CONTAINS_STRUCT (code, TS_OMP_CLAUSE))
596 /* This is only used by High GIMPLE. */
604 /* Emit location LOC to output block OB. */
607 lto_output_location (struct output_block *ob, location_t loc)
609 expanded_location xloc;
611 if (loc == UNKNOWN_LOCATION)
613 output_string (ob, ob->main_stream, NULL);
617 xloc = expand_location (loc);
619 output_string (ob, ob->main_stream, xloc.file);
620 output_sleb128 (ob, xloc.line);
621 output_sleb128 (ob, xloc.column);
622 output_sleb128 (ob, xloc.sysp);
624 ob->current_file = xloc.file;
625 ob->current_line = xloc.line;
626 ob->current_col = xloc.column;
630 /* Return true if tree node T is written to various tables. For these
631 nodes, we sometimes want to write their phyiscal representation
632 (via lto_output_tree), and sometimes we need to emit an index
633 reference into a table (via lto_output_tree_ref). */
636 tree_is_indexable (tree t)
638 if (TREE_CODE (t) == PARM_DECL)
640 else if (TREE_CODE (t) == VAR_DECL && decl_function_context (t))
643 return (TYPE_P (t) || DECL_P (t) || TREE_CODE (t) == SSA_NAME);
647 /* If EXPR is an indexable tree node, output a reference to it to
648 output block OB. Otherwise, output the physical representation of
652 lto_output_tree_ref (struct output_block *ob, tree expr)
656 if (expr == NULL_TREE)
662 if (!tree_is_indexable (expr))
664 /* Even though we are emitting the physical representation of
665 EXPR, its leaves must be emitted as references. */
666 lto_output_tree (ob, expr, true);
672 output_type_ref (ob, expr);
676 code = TREE_CODE (expr);
680 output_record_start (ob, LTO_ssa_name_ref);
681 output_uleb128 (ob, SSA_NAME_VERSION (expr));
685 output_record_start (ob, LTO_field_decl_ref);
686 lto_output_field_decl_index (ob->decl_state, ob->main_stream, expr);
690 output_record_start (ob, LTO_function_decl_ref);
691 lto_output_fn_decl_index (ob->decl_state, ob->main_stream, expr);
695 case DEBUG_EXPR_DECL:
696 gcc_assert (decl_function_context (expr) == NULL);
697 output_record_start (ob, LTO_global_decl_ref);
698 lto_output_var_decl_index (ob->decl_state, ob->main_stream, expr);
702 output_record_start (ob, LTO_const_decl_ref);
703 lto_output_var_decl_index (ob->decl_state, ob->main_stream, expr);
707 gcc_assert (decl_function_context (expr) == NULL);
708 output_record_start (ob, LTO_imported_decl_ref);
709 lto_output_var_decl_index (ob->decl_state, ob->main_stream, expr);
713 output_record_start (ob, LTO_type_decl_ref);
714 lto_output_type_decl_index (ob->decl_state, ob->main_stream, expr);
718 output_record_start (ob, LTO_namespace_decl_ref);
719 lto_output_namespace_decl_index (ob->decl_state, ob->main_stream, expr);
723 output_record_start (ob, LTO_label_decl_ref);
724 lto_output_var_decl_index (ob->decl_state, ob->main_stream, expr);
728 output_record_start (ob, LTO_result_decl_ref);
729 lto_output_var_decl_index (ob->decl_state, ob->main_stream, expr);
733 /* No other node is indexable, so it should have been handled
734 by lto_output_tree. */
740 /* If REF_P is true, emit a reference to EXPR in output block OB,
741 otherwise emit the physical representation of EXPR in OB. */
744 lto_output_tree_or_ref (struct output_block *ob, tree expr, bool ref_p)
747 lto_output_tree_ref (ob, expr);
749 lto_output_tree (ob, expr, false);
753 /* Emit the chain of tree nodes starting at T. OB is the output block
754 to write to. REF_P is true if chain elements should be emitted
758 lto_output_chain (struct output_block *ob, tree t, bool ref_p)
762 count = list_length (t);
763 output_sleb128 (ob, count);
764 for (i = 0; i < count; i++)
768 /* Clear TREE_CHAIN to avoid blindly recursing into the rest
770 saved_chain = TREE_CHAIN (t);
771 TREE_CHAIN (t) = NULL_TREE;
773 lto_output_tree_or_ref (ob, t, ref_p);
775 TREE_CHAIN (t) = saved_chain;
781 /* Write all pointer fields in the TS_COMMON structure of EXPR to output
782 block OB. If REF_P is true, write a reference to EXPR's pointer
786 lto_output_ts_common_tree_pointers (struct output_block *ob, tree expr,
789 lto_output_tree_or_ref (ob, TREE_TYPE (expr), ref_p);
793 /* Write all pointer fields in the TS_VECTOR structure of EXPR to output
794 block OB. If REF_P is true, write a reference to EXPR's pointer
798 lto_output_ts_vector_tree_pointers (struct output_block *ob, tree expr,
801 lto_output_chain (ob, TREE_VECTOR_CST_ELTS (expr), ref_p);
805 /* Write all pointer fields in the TS_COMPLEX structure of EXPR to output
806 block OB. If REF_P is true, write a reference to EXPR's pointer
810 lto_output_ts_complex_tree_pointers (struct output_block *ob, tree expr,
813 lto_output_tree_or_ref (ob, TREE_REALPART (expr), ref_p);
814 lto_output_tree_or_ref (ob, TREE_IMAGPART (expr), ref_p);
818 /* Write all pointer fields in the TS_DECL_MINIMAL structure of EXPR
819 to output block OB. If REF_P is true, write a reference to EXPR's
823 lto_output_ts_decl_minimal_tree_pointers (struct output_block *ob, tree expr,
826 lto_output_tree_or_ref (ob, DECL_NAME (expr), ref_p);
827 lto_output_tree_or_ref (ob, DECL_CONTEXT (expr), ref_p);
828 lto_output_location (ob, DECL_SOURCE_LOCATION (expr));
832 /* Write all pointer fields in the TS_DECL_COMMON structure of EXPR to
833 output block OB. If REF_P is true, write a reference to EXPR's
837 lto_output_ts_decl_common_tree_pointers (struct output_block *ob, tree expr,
840 lto_output_tree_or_ref (ob, DECL_SIZE (expr), ref_p);
841 lto_output_tree_or_ref (ob, DECL_SIZE_UNIT (expr), ref_p);
843 if (TREE_CODE (expr) != FUNCTION_DECL)
844 lto_output_tree_or_ref (ob, DECL_INITIAL (expr), ref_p);
846 lto_output_tree_or_ref (ob, DECL_ATTRIBUTES (expr), ref_p);
847 lto_output_tree_or_ref (ob, DECL_ABSTRACT_ORIGIN (expr), ref_p);
849 if (TREE_CODE (expr) == PARM_DECL)
850 lto_output_chain (ob, TREE_CHAIN (expr), ref_p);
854 /* Write all pointer fields in the TS_DECL_NON_COMMON structure of
855 EXPR to output block OB. If REF_P is true, write a reference to EXPR's
859 lto_output_ts_decl_non_common_tree_pointers (struct output_block *ob,
860 tree expr, bool ref_p)
862 if (TREE_CODE (expr) == FUNCTION_DECL)
864 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
865 At this point, it should not exist. Either because it was
866 converted to gimple or because DECL didn't have a GENERIC
867 representation in this TU. */
868 gcc_assert (DECL_SAVED_TREE (expr) == NULL_TREE);
869 lto_output_tree_or_ref (ob, DECL_ARGUMENTS (expr), ref_p);
870 lto_output_tree_or_ref (ob, DECL_RESULT (expr), ref_p);
872 lto_output_tree_or_ref (ob, DECL_VINDEX (expr), ref_p);
876 /* Write all pointer fields in the TS_DECL_WITH_VIS structure of EXPR
877 to output block OB. If REF_P is true, write a reference to EXPR's
881 lto_output_ts_decl_with_vis_tree_pointers (struct output_block *ob, tree expr,
884 /* Make sure we don't inadvertently set the assembler name. */
885 if (DECL_ASSEMBLER_NAME_SET_P (expr))
886 lto_output_tree_or_ref (ob, DECL_ASSEMBLER_NAME (expr), ref_p);
890 lto_output_tree_or_ref (ob, DECL_SECTION_NAME (expr), ref_p);
891 lto_output_tree_or_ref (ob, DECL_COMDAT_GROUP (expr), ref_p);
895 /* Write all pointer fields in the TS_FIELD_DECL structure of EXPR to
896 output block OB. If REF_P is true, write a reference to EXPR's
900 lto_output_ts_field_decl_tree_pointers (struct output_block *ob, tree expr,
903 lto_output_tree_or_ref (ob, DECL_FIELD_OFFSET (expr), ref_p);
904 lto_output_tree_or_ref (ob, DECL_BIT_FIELD_TYPE (expr), ref_p);
905 lto_output_tree_or_ref (ob, DECL_QUALIFIER (expr), ref_p);
906 lto_output_tree_or_ref (ob, DECL_FIELD_BIT_OFFSET (expr), ref_p);
907 lto_output_tree_or_ref (ob, DECL_FCONTEXT (expr), ref_p);
908 lto_output_chain (ob, TREE_CHAIN (expr), ref_p);
912 /* Write all pointer fields in the TS_FUNCTION_DECL structure of EXPR
913 to output block OB. If REF_P is true, write a reference to EXPR's
917 lto_output_ts_function_decl_tree_pointers (struct output_block *ob, tree expr,
920 /* DECL_STRUCT_FUNCTION is handled by lto_output_function. FIXME lto,
921 maybe it should be handled here? */
922 lto_output_tree_or_ref (ob, DECL_FUNCTION_PERSONALITY (expr), ref_p);
923 lto_output_tree_or_ref (ob, DECL_FUNCTION_SPECIFIC_TARGET (expr), ref_p);
924 lto_output_tree_or_ref (ob, DECL_FUNCTION_SPECIFIC_OPTIMIZATION (expr),
929 /* Write all pointer fields in the TS_TYPE structure of EXPR to output
930 block OB. If REF_P is true, write a reference to EXPR's pointer
934 lto_output_ts_type_tree_pointers (struct output_block *ob, tree expr,
937 if (TREE_CODE (expr) == ENUMERAL_TYPE)
938 lto_output_tree_or_ref (ob, TYPE_VALUES (expr), ref_p);
939 else if (TREE_CODE (expr) == ARRAY_TYPE)
940 lto_output_tree_or_ref (ob, TYPE_DOMAIN (expr), ref_p);
941 else if (TREE_CODE (expr) == RECORD_TYPE || TREE_CODE (expr) == UNION_TYPE)
942 lto_output_tree_or_ref (ob, TYPE_FIELDS (expr), ref_p);
943 else if (TREE_CODE (expr) == FUNCTION_TYPE || TREE_CODE (expr) == METHOD_TYPE)
944 lto_output_tree_or_ref (ob, TYPE_ARG_TYPES (expr), ref_p);
945 else if (TREE_CODE (expr) == VECTOR_TYPE)
946 lto_output_tree_or_ref (ob, TYPE_DEBUG_REPRESENTATION_TYPE (expr), ref_p);
948 lto_output_tree_or_ref (ob, TYPE_SIZE (expr), ref_p);
949 lto_output_tree_or_ref (ob, TYPE_SIZE_UNIT (expr), ref_p);
950 lto_output_tree_or_ref (ob, TYPE_ATTRIBUTES (expr), ref_p);
951 lto_output_tree_or_ref (ob, TYPE_NAME (expr), ref_p);
952 /* Do not stream TYPE_POINTER_TO or TYPE_REFERENCE_TO nor
953 TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. */
954 if (!POINTER_TYPE_P (expr))
955 lto_output_tree_or_ref (ob, TYPE_MINVAL (expr), ref_p);
956 lto_output_tree_or_ref (ob, TYPE_MAXVAL (expr), ref_p);
957 lto_output_tree_or_ref (ob, TYPE_MAIN_VARIANT (expr), ref_p);
958 /* Do not stream TYPE_NEXT_VARIANT, we reconstruct the variant lists
960 if (TREE_CODE (expr) == RECORD_TYPE || TREE_CODE (expr) == UNION_TYPE)
961 lto_output_tree_or_ref (ob, TYPE_BINFO (expr), ref_p);
962 lto_output_tree_or_ref (ob, TYPE_CONTEXT (expr), ref_p);
963 lto_output_tree_or_ref (ob, TYPE_CANONICAL (expr), ref_p);
967 /* Write all pointer fields in the TS_LIST structure of EXPR to output
968 block OB. If REF_P is true, write a reference to EXPR's pointer
972 lto_output_ts_list_tree_pointers (struct output_block *ob, tree expr,
975 lto_output_tree_or_ref (ob, TREE_PURPOSE (expr), ref_p);
976 lto_output_tree_or_ref (ob, TREE_VALUE (expr), ref_p);
977 lto_output_chain (ob, TREE_CHAIN (expr), ref_p);
981 /* Write all pointer fields in the TS_VEC structure of EXPR to output
982 block OB. If REF_P is true, write a reference to EXPR's pointer
986 lto_output_ts_vec_tree_pointers (struct output_block *ob, tree expr, bool ref_p)
990 /* Note that the number of slots for EXPR has already been emitted
991 in EXPR's header (see lto_output_tree_header). */
992 for (i = 0; i < TREE_VEC_LENGTH (expr); i++)
993 lto_output_tree_or_ref (ob, TREE_VEC_ELT (expr, i), ref_p);
997 /* Write all pointer fields in the TS_EXP structure of EXPR to output
998 block OB. If REF_P is true, write a reference to EXPR's pointer
1002 lto_output_ts_exp_tree_pointers (struct output_block *ob, tree expr, bool ref_p)
1006 output_sleb128 (ob, TREE_OPERAND_LENGTH (expr));
1007 for (i = 0; i < TREE_OPERAND_LENGTH (expr); i++)
1008 lto_output_tree_or_ref (ob, TREE_OPERAND (expr, i), ref_p);
1009 lto_output_location (ob, EXPR_LOCATION (expr));
1010 lto_output_tree_or_ref (ob, TREE_BLOCK (expr), ref_p);
1014 /* Write all pointer fields in the TS_BLOCK structure of EXPR to output
1015 block OB. If REF_P is true, write a reference to EXPR's pointer
1019 lto_output_ts_block_tree_pointers (struct output_block *ob, tree expr,
1025 lto_output_location (ob, BLOCK_SOURCE_LOCATION (expr));
1026 lto_output_chain (ob, BLOCK_VARS (expr), ref_p);
1028 output_uleb128 (ob, VEC_length (tree, BLOCK_NONLOCALIZED_VARS (expr)));
1029 for (i = 0; VEC_iterate (tree, BLOCK_NONLOCALIZED_VARS (expr), i, t); i++)
1030 lto_output_tree_or_ref (ob, t, ref_p);
1032 lto_output_tree_or_ref (ob, BLOCK_SUPERCONTEXT (expr), ref_p);
1033 lto_output_tree_or_ref (ob, BLOCK_ABSTRACT_ORIGIN (expr), ref_p);
1034 lto_output_tree_or_ref (ob, BLOCK_FRAGMENT_ORIGIN (expr), ref_p);
1035 lto_output_tree_or_ref (ob, BLOCK_FRAGMENT_CHAIN (expr), ref_p);
1036 lto_output_chain (ob, BLOCK_SUBBLOCKS (expr), ref_p);
1040 /* Write all pointer fields in the TS_BINFO structure of EXPR to output
1041 block OB. If REF_P is true, write a reference to EXPR's pointer
1045 lto_output_ts_binfo_tree_pointers (struct output_block *ob, tree expr,
1051 /* Note that the number of BINFO slots has already been emitted in
1052 EXPR's header (see lto_output_tree_header) because this length
1053 is needed to build the empty BINFO node on the reader side. */
1054 for (i = 0; VEC_iterate (tree, BINFO_BASE_BINFOS (expr), i, t); i++)
1055 lto_output_tree_or_ref (ob, t, ref_p);
1058 lto_output_tree_or_ref (ob, BINFO_OFFSET (expr), ref_p);
1059 lto_output_tree_or_ref (ob, BINFO_VTABLE (expr), ref_p);
1060 lto_output_tree_or_ref (ob, BINFO_VIRTUALS (expr), ref_p);
1061 lto_output_tree_or_ref (ob, BINFO_VPTR_FIELD (expr), ref_p);
1063 output_uleb128 (ob, VEC_length (tree, BINFO_BASE_ACCESSES (expr)));
1064 for (i = 0; VEC_iterate (tree, BINFO_BASE_ACCESSES (expr), i, t); i++)
1065 lto_output_tree_or_ref (ob, t, ref_p);
1067 lto_output_tree_or_ref (ob, BINFO_INHERITANCE_CHAIN (expr), ref_p);
1068 lto_output_tree_or_ref (ob, BINFO_SUBVTT_INDEX (expr), ref_p);
1069 lto_output_tree_or_ref (ob, BINFO_VPTR_INDEX (expr), ref_p);
1073 /* Write all pointer fields in the TS_CONSTRUCTOR structure of EXPR to
1074 output block OB. If REF_P is true, write a reference to EXPR's
1078 lto_output_ts_constructor_tree_pointers (struct output_block *ob, tree expr,
1084 output_uleb128 (ob, CONSTRUCTOR_NELTS (expr));
1085 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (expr), i, index, value)
1087 lto_output_tree_or_ref (ob, index, ref_p);
1088 lto_output_tree_or_ref (ob, value, ref_p);
1093 /* Helper for lto_output_tree. Write all pointer fields in EXPR to output
1094 block OB. If REF_P is true, the leaves of EXPR are emitted as
1098 lto_output_tree_pointers (struct output_block *ob, tree expr, bool ref_p)
1100 enum tree_code code;
1102 code = TREE_CODE (expr);
1104 if (CODE_CONTAINS_STRUCT (code, TS_COMMON))
1105 lto_output_ts_common_tree_pointers (ob, expr, ref_p);
1107 if (CODE_CONTAINS_STRUCT (code, TS_VECTOR))
1108 lto_output_ts_vector_tree_pointers (ob, expr, ref_p);
1110 if (CODE_CONTAINS_STRUCT (code, TS_COMPLEX))
1111 lto_output_ts_complex_tree_pointers (ob, expr, ref_p);
1113 if (CODE_CONTAINS_STRUCT (code, TS_DECL_MINIMAL))
1114 lto_output_ts_decl_minimal_tree_pointers (ob, expr, ref_p);
1116 if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
1117 lto_output_ts_decl_common_tree_pointers (ob, expr, ref_p);
1119 if (CODE_CONTAINS_STRUCT (code, TS_DECL_NON_COMMON))
1120 lto_output_ts_decl_non_common_tree_pointers (ob, expr, ref_p);
1122 if (CODE_CONTAINS_STRUCT (code, TS_DECL_WITH_VIS))
1123 lto_output_ts_decl_with_vis_tree_pointers (ob, expr, ref_p);
1125 if (CODE_CONTAINS_STRUCT (code, TS_FIELD_DECL))
1126 lto_output_ts_field_decl_tree_pointers (ob, expr, ref_p);
1128 if (CODE_CONTAINS_STRUCT (code, TS_FUNCTION_DECL))
1129 lto_output_ts_function_decl_tree_pointers (ob, expr, ref_p);
1131 if (CODE_CONTAINS_STRUCT (code, TS_TYPE))
1132 lto_output_ts_type_tree_pointers (ob, expr, ref_p);
1134 if (CODE_CONTAINS_STRUCT (code, TS_LIST))
1135 lto_output_ts_list_tree_pointers (ob, expr, ref_p);
1137 if (CODE_CONTAINS_STRUCT (code, TS_VEC))
1138 lto_output_ts_vec_tree_pointers (ob, expr, ref_p);
1140 if (CODE_CONTAINS_STRUCT (code, TS_EXP))
1141 lto_output_ts_exp_tree_pointers (ob, expr, ref_p);
1143 if (CODE_CONTAINS_STRUCT (code, TS_SSA_NAME))
1145 /* We only stream the version number of SSA names. */
1149 if (CODE_CONTAINS_STRUCT (code, TS_BLOCK))
1150 lto_output_ts_block_tree_pointers (ob, expr, ref_p);
1152 if (CODE_CONTAINS_STRUCT (code, TS_BINFO))
1153 lto_output_ts_binfo_tree_pointers (ob, expr, ref_p);
1155 if (CODE_CONTAINS_STRUCT (code, TS_CONSTRUCTOR))
1156 lto_output_ts_constructor_tree_pointers (ob, expr, ref_p);
1158 if (CODE_CONTAINS_STRUCT (code, TS_STATEMENT_LIST))
1160 /* This should only appear in GENERIC. */
1164 if (CODE_CONTAINS_STRUCT (code, TS_OMP_CLAUSE))
1166 /* This should only appear in High GIMPLE. */
1170 if (CODE_CONTAINS_STRUCT (code, TS_OPTIMIZATION))
1171 sorry ("gimple bytecode streams do not support the optimization attribute");
1173 if (CODE_CONTAINS_STRUCT (code, TS_TARGET_OPTION))
1174 sorry ("gimple bytecode streams do not support the target attribute");
1178 /* Emit header information for tree EXPR to output block OB. The header
1179 contains everything needed to instantiate an empty skeleton for
1180 EXPR on the reading side. IX is the index into the streamer cache
1181 where EXPR is stored. REF_P is as in lto_output_tree. */
1184 lto_output_tree_header (struct output_block *ob, tree expr, int ix)
1187 enum tree_code code;
1189 /* We should not see any non-GIMPLE tree nodes here. */
1190 code = TREE_CODE (expr);
1191 if (!lto_is_streamable (expr))
1192 internal_error ("tree code %qs is not supported in gimple streams",
1193 tree_code_name[code]);
1195 /* The header of a tree node consists of its tag, the size of
1196 the node, and any other information needed to instantiate
1197 EXPR on the reading side (such as the number of slots in
1198 variable sized nodes). */
1199 tag = lto_tree_code_to_tag (code);
1200 output_record_start (ob, tag);
1201 output_sleb128 (ob, ix);
1203 /* The following will cause bootstrap miscomparisons. Enable with care. */
1204 #ifdef LTO_STREAMER_DEBUG
1205 /* This is used mainly for debugging purposes. When the reader
1206 and the writer do not agree on a streamed node, the pointer
1207 value for EXPR can be used to track down the differences in
1209 gcc_assert ((HOST_WIDEST_INT) (intptr_t) expr == (intptr_t) expr);
1210 output_sleb128 (ob, (HOST_WIDEST_INT) (intptr_t) expr);
1213 /* The text in strings and identifiers are completely emitted in
1215 if (CODE_CONTAINS_STRUCT (code, TS_STRING))
1216 output_string_cst (ob, ob->main_stream, expr);
1217 else if (CODE_CONTAINS_STRUCT (code, TS_IDENTIFIER))
1218 output_identifier (ob, ob->main_stream, expr);
1219 else if (CODE_CONTAINS_STRUCT (code, TS_VEC))
1220 output_sleb128 (ob, TREE_VEC_LENGTH (expr));
1221 else if (CODE_CONTAINS_STRUCT (code, TS_BINFO))
1222 output_uleb128 (ob, BINFO_N_BASE_BINFOS (expr));
1226 /* Write the code and class of builtin EXPR to output block OB. IX is
1227 the index into the streamer cache where EXPR is stored.*/
1230 lto_output_builtin_tree (struct output_block *ob, tree expr, int ix)
1232 gcc_assert (lto_stream_as_builtin_p (expr));
1234 if (DECL_BUILT_IN_CLASS (expr) == BUILT_IN_MD
1235 && !targetm.builtin_decl)
1236 sorry ("gimple bytecode streams do not support machine specific builtin "
1237 "functions on this target");
1239 output_record_start (ob, LTO_builtin_decl);
1240 output_uleb128 (ob, DECL_BUILT_IN_CLASS (expr));
1241 output_uleb128 (ob, DECL_FUNCTION_CODE (expr));
1242 output_sleb128 (ob, ix);
1244 if (DECL_ASSEMBLER_NAME_SET_P (expr))
1246 /* When the assembler name of a builtin gets a user name,
1247 the new name is always prefixed with '*' by
1248 set_builtin_user_assembler_name. So, to prevent the
1249 reader side from adding a second '*', we omit it here. */
1250 const char *str = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (expr));
1251 if (strlen (str) > 1 && str[0] == '*')
1252 output_string (ob, ob->main_stream, &str[1]);
1254 output_string (ob, ob->main_stream, NULL);
1257 output_string (ob, ob->main_stream, NULL);
1261 /* Write a physical representation of tree node EXPR to output block
1262 OB. If REF_P is true, the leaves of EXPR are emitted as references
1263 via lto_output_tree_ref. IX is the index into the streamer cache
1264 where EXPR is stored. */
1267 lto_write_tree (struct output_block *ob, tree expr, bool ref_p, int ix)
1269 struct bitpack_d *bp;
1271 /* Write the header, containing everything needed to materialize
1272 EXPR on the reading side. */
1273 lto_output_tree_header (ob, expr, ix);
1275 /* Pack all the non-pointer fields in EXPR into a bitpack and write
1276 the resulting bitpack. */
1277 bp = pack_value_fields (expr);
1278 lto_output_bitpack (ob->main_stream, bp);
1279 bitpack_delete (bp);
1281 /* Write all the pointer fields in EXPR. */
1282 lto_output_tree_pointers (ob, expr, ref_p);
1284 /* Mark the end of EXPR. */
1289 /* Emit the integer constant CST to output block OB. If REF_P is true,
1290 CST's type will be emitted as a reference. */
1293 lto_output_integer_cst (struct output_block *ob, tree cst, bool ref_p)
1295 output_record_start (ob, lto_tree_code_to_tag (INTEGER_CST));
1296 lto_output_tree_or_ref (ob, TREE_TYPE (cst), ref_p);
1297 lto_output_1_stream (ob->main_stream, TREE_OVERFLOW_P (cst));
1298 output_uleb128 (ob, TREE_INT_CST_LOW (cst));
1299 output_uleb128 (ob, TREE_INT_CST_HIGH (cst));
1303 /* Emit the physical representation of tree node EXPR to output block
1304 OB. If REF_P is true, the leaves of EXPR are emitted as references
1305 via lto_output_tree_ref. */
1308 lto_output_tree (struct output_block *ob, tree expr, bool ref_p)
1314 if (expr == NULL_TREE)
1320 /* INTEGER_CST nodes are special because they need their original type
1321 to be materialized by the reader (to implement TYPE_CACHED_VALUES). */
1322 if (TREE_CODE (expr) == INTEGER_CST)
1324 lto_output_integer_cst (ob, expr, ref_p);
1328 /* Determine the offset in the stream where EXPR will be written.
1329 This is used when emitting pickle references so the reader knows
1330 where to reconstruct the pickled object from. This allows
1331 circular and forward references within the same stream. */
1332 offset = ob->main_stream->total_size;
1334 existed_p = lto_streamer_cache_insert (ob->writer_cache, expr, &ix, &offset);
1337 /* If a node has already been streamed out, make sure that
1338 we don't write it more than once. Otherwise, the reader
1339 will instantiate two different nodes for the same object. */
1340 output_record_start (ob, LTO_tree_pickle_reference);
1341 output_sleb128 (ob, ix);
1342 output_uleb128 (ob, lto_tree_code_to_tag (TREE_CODE (expr)));
1343 output_uleb128 (ob, offset);
1345 else if (lto_stream_as_builtin_p (expr))
1347 /* MD and NORMAL builtins do not need to be written out
1348 completely as they are always instantiated by the
1349 compiler on startup. The only builtins that need to
1350 be written out are BUILT_IN_FRONTEND. For all other
1351 builtins, we simply write the class and code. */
1352 lto_output_builtin_tree (ob, expr, ix);
1356 /* This is the first time we see EXPR, write its fields
1358 lto_write_tree (ob, expr, ref_p, ix);
1363 /* Output to OB a list of try/catch handlers starting with FIRST. */
1366 output_eh_try_list (struct output_block *ob, eh_catch first)
1370 for (n = first; n; n = n->next_catch)
1372 output_record_start (ob, LTO_eh_catch);
1373 lto_output_tree_ref (ob, n->type_list);
1374 lto_output_tree_ref (ob, n->filter_list);
1375 lto_output_tree_ref (ob, n->label);
1382 /* Output EH region R in function FN to OB. CURR_RN is the slot index
1383 that is being emitted in FN->EH->REGION_ARRAY. This is used to
1384 detect EH region sharing. */
1387 output_eh_region (struct output_block *ob, eh_region r)
1397 if (r->type == ERT_CLEANUP)
1398 tag = LTO_ert_cleanup;
1399 else if (r->type == ERT_TRY)
1401 else if (r->type == ERT_ALLOWED_EXCEPTIONS)
1402 tag = LTO_ert_allowed_exceptions;
1403 else if (r->type == ERT_MUST_NOT_THROW)
1404 tag = LTO_ert_must_not_throw;
1408 output_record_start (ob, tag);
1409 output_sleb128 (ob, r->index);
1412 output_sleb128 (ob, r->outer->index);
1417 output_sleb128 (ob, r->inner->index);
1422 output_sleb128 (ob, r->next_peer->index);
1426 if (r->type == ERT_TRY)
1428 output_eh_try_list (ob, r->u.eh_try.first_catch);
1430 else if (r->type == ERT_ALLOWED_EXCEPTIONS)
1432 lto_output_tree_ref (ob, r->u.allowed.type_list);
1433 lto_output_tree_ref (ob, r->u.allowed.label);
1434 output_uleb128 (ob, r->u.allowed.filter);
1436 else if (r->type == ERT_MUST_NOT_THROW)
1438 lto_output_tree_ref (ob, r->u.must_not_throw.failure_decl);
1439 lto_output_location (ob, r->u.must_not_throw.failure_loc);
1442 if (r->landing_pads)
1443 output_sleb128 (ob, r->landing_pads->index);
1449 /* Output landing pad LP to OB. */
1452 output_eh_lp (struct output_block *ob, eh_landing_pad lp)
1460 output_record_start (ob, LTO_eh_landing_pad);
1461 output_sleb128 (ob, lp->index);
1463 output_sleb128 (ob, lp->next_lp->index);
1468 output_sleb128 (ob, lp->region->index);
1472 lto_output_tree_ref (ob, lp->post_landing_pad);
1476 /* Output the existing eh_table to OB. */
1479 output_eh_regions (struct output_block *ob, struct function *fn)
1481 if (fn->eh && fn->eh->region_tree)
1488 output_record_start (ob, LTO_eh_table);
1490 /* Emit the index of the root of the EH region tree. */
1491 output_sleb128 (ob, fn->eh->region_tree->index);
1493 /* Emit all the EH regions in the region array. */
1494 output_sleb128 (ob, VEC_length (eh_region, fn->eh->region_array));
1495 for (i = 0; VEC_iterate (eh_region, fn->eh->region_array, i, eh); i++)
1496 output_eh_region (ob, eh);
1498 /* Emit all landing pads. */
1499 output_sleb128 (ob, VEC_length (eh_landing_pad, fn->eh->lp_array));
1500 for (i = 0; VEC_iterate (eh_landing_pad, fn->eh->lp_array, i, lp); i++)
1501 output_eh_lp (ob, lp);
1503 /* Emit all the runtime type data. */
1504 output_sleb128 (ob, VEC_length (tree, fn->eh->ttype_data));
1505 for (i = 0; VEC_iterate (tree, fn->eh->ttype_data, i, ttype); i++)
1506 lto_output_tree_ref (ob, ttype);
1508 /* Emit the table of action chains. */
1509 if (targetm.arm_eabi_unwinder)
1512 output_sleb128 (ob, VEC_length (tree, fn->eh->ehspec_data.arm_eabi));
1514 VEC_iterate (tree, fn->eh->ehspec_data.arm_eabi, i, t);
1516 lto_output_tree_ref (ob, t);
1521 output_sleb128 (ob, VEC_length (uchar, fn->eh->ehspec_data.other));
1522 for (i = 0; VEC_iterate (uchar, fn->eh->ehspec_data.other, i, c); i++)
1523 lto_output_1_stream (ob->main_stream, c);
1527 /* The 0 either terminates the record or indicates that there are no
1528 eh_records at all. */
1533 /* Output all of the active ssa names to the ssa_names stream. */
1536 output_ssa_names (struct output_block *ob, struct function *fn)
1538 unsigned int i, len;
1540 len = VEC_length (tree, SSANAMES (fn));
1541 output_uleb128 (ob, len);
1543 for (i = 1; i < len; i++)
1545 tree ptr = VEC_index (tree, SSANAMES (fn), i);
1547 if (ptr == NULL_TREE
1548 || SSA_NAME_IN_FREE_LIST (ptr)
1549 || !is_gimple_reg (ptr))
1552 output_uleb128 (ob, i);
1553 lto_output_1_stream (ob->main_stream, SSA_NAME_IS_DEFAULT_DEF (ptr));
1554 lto_output_tree_ref (ob, SSA_NAME_VAR (ptr));
1561 /* Output the cfg. */
1564 output_cfg (struct output_block *ob, struct function *fn)
1566 struct lto_output_stream *tmp_stream = ob->main_stream;
1569 ob->main_stream = ob->cfg_stream;
1571 output_uleb128 (ob, profile_status_for_function (fn));
1573 /* Output the number of the highest basic block. */
1574 output_uleb128 (ob, last_basic_block_for_function (fn));
1576 FOR_ALL_BB_FN (bb, fn)
1581 output_sleb128 (ob, bb->index);
1583 /* Output the successors and the edge flags. */
1584 output_uleb128 (ob, EDGE_COUNT (bb->succs));
1585 FOR_EACH_EDGE (e, ei, bb->succs)
1587 output_uleb128 (ob, e->dest->index);
1588 output_sleb128 (ob, e->probability);
1589 output_sleb128 (ob, e->count);
1590 output_uleb128 (ob, e->flags);
1594 output_sleb128 (ob, -1);
1596 bb = ENTRY_BLOCK_PTR;
1599 output_sleb128 (ob, bb->next_bb->index);
1603 output_sleb128 (ob, -1);
1605 ob->main_stream = tmp_stream;
1609 /* Output PHI function PHI to the main stream in OB. */
1612 output_phi (struct output_block *ob, gimple phi)
1614 unsigned i, len = gimple_phi_num_args (phi);
1616 output_record_start (ob, lto_gimple_code_to_tag (GIMPLE_PHI));
1617 output_uleb128 (ob, SSA_NAME_VERSION (PHI_RESULT (phi)));
1619 for (i = 0; i < len; i++)
1621 lto_output_tree_ref (ob, gimple_phi_arg_def (phi, i));
1622 output_uleb128 (ob, gimple_phi_arg_edge (phi, i)->src->index);
1623 lto_output_location (ob, gimple_phi_arg_location (phi, i));
1628 /* Emit statement STMT on the main stream of output block OB. */
1631 output_gimple_stmt (struct output_block *ob, gimple stmt)
1634 enum gimple_code code;
1636 struct bitpack_d *bp;
1638 /* Emit identifying tag. */
1639 code = gimple_code (stmt);
1640 tag = lto_gimple_code_to_tag (code);
1641 output_record_start (ob, tag);
1643 /* Emit the tuple header. */
1644 bp = bitpack_create ();
1645 bp_pack_value (bp, gimple_num_ops (stmt), sizeof (unsigned) * 8);
1646 bp_pack_value (bp, gimple_no_warning_p (stmt), 1);
1647 if (is_gimple_assign (stmt))
1648 bp_pack_value (bp, gimple_assign_nontemporal_move_p (stmt), 1);
1649 bp_pack_value (bp, gimple_has_volatile_ops (stmt), 1);
1650 bp_pack_value (bp, stmt->gsbase.subcode, 16);
1651 lto_output_bitpack (ob->main_stream, bp);
1652 bitpack_delete (bp);
1654 /* Emit location information for the statement. */
1655 lto_output_location (ob, gimple_location (stmt));
1657 /* Emit the lexical block holding STMT. */
1658 lto_output_tree (ob, gimple_block (stmt), true);
1660 /* Emit the operands. */
1661 switch (gimple_code (stmt))
1664 output_sleb128 (ob, gimple_resx_region (stmt));
1667 case GIMPLE_EH_MUST_NOT_THROW:
1668 lto_output_tree_ref (ob, gimple_eh_must_not_throw_fndecl (stmt));
1671 case GIMPLE_EH_DISPATCH:
1672 output_sleb128 (ob, gimple_eh_dispatch_region (stmt));
1676 lto_output_uleb128_stream (ob->main_stream, gimple_asm_ninputs (stmt));
1677 lto_output_uleb128_stream (ob->main_stream, gimple_asm_noutputs (stmt));
1678 lto_output_uleb128_stream (ob->main_stream, gimple_asm_nclobbers (stmt));
1679 output_string (ob, ob->main_stream, gimple_asm_string (stmt));
1690 for (i = 0; i < gimple_num_ops (stmt); i++)
1692 tree op = gimple_op (stmt, i);
1693 lto_output_tree_ref (ob, op);
1698 case GIMPLE_PREDICT:
1707 /* Output a basic block BB to the main stream in OB for this FN. */
1710 output_bb (struct output_block *ob, basic_block bb, struct function *fn)
1712 gimple_stmt_iterator bsi = gsi_start_bb (bb);
1714 output_record_start (ob,
1715 (!gsi_end_p (bsi)) || phi_nodes (bb)
1719 output_uleb128 (ob, bb->index);
1720 output_sleb128 (ob, bb->count);
1721 output_sleb128 (ob, bb->loop_depth);
1722 output_sleb128 (ob, bb->frequency);
1723 output_sleb128 (ob, bb->flags);
1725 if (!gsi_end_p (bsi) || phi_nodes (bb))
1727 /* Output the statements. The list of statements is terminated
1729 for (bsi = gsi_start_bb (bb); !gsi_end_p (bsi); gsi_next (&bsi))
1732 gimple stmt = gsi_stmt (bsi);
1734 output_gimple_stmt (ob, stmt);
1736 /* Emit the EH region holding STMT. */
1737 region = lookup_stmt_eh_lp_fn (fn, stmt);
1740 output_record_start (ob, LTO_eh_region);
1741 output_sleb128 (ob, region);
1749 for (bsi = gsi_start_phis (bb); !gsi_end_p (bsi); gsi_next (&bsi))
1751 gimple phi = gsi_stmt (bsi);
1753 /* Only emit PHIs for gimple registers. PHI nodes for .MEM
1754 will be filled in on reading when the SSA form is
1756 if (is_gimple_reg (gimple_phi_result (phi)))
1757 output_phi (ob, phi);
1764 /* Create the header in the file using OB. If the section type is for
1765 a function, set FN to the decl for that function. */
1768 produce_asm (struct output_block *ob, tree fn)
1770 enum lto_section_type section_type = ob->section_type;
1771 struct lto_function_header header;
1773 struct lto_output_stream *header_stream;
1775 if (section_type == LTO_section_function_body)
1777 const char *name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (fn));
1778 section_name = lto_get_section_name (section_type, name);
1781 section_name = lto_get_section_name (section_type, NULL);
1783 lto_begin_section (section_name, !flag_wpa);
1784 free (section_name);
1786 /* The entire header is stream computed here. */
1787 memset (&header, 0, sizeof (struct lto_function_header));
1789 /* Write the header. */
1790 header.lto_header.major_version = LTO_major_version;
1791 header.lto_header.minor_version = LTO_minor_version;
1792 header.lto_header.section_type = section_type;
1794 header.compressed_size = 0;
1796 if (section_type == LTO_section_function_body)
1797 header.cfg_size = ob->cfg_stream->total_size;
1798 header.main_size = ob->main_stream->total_size;
1799 header.string_size = ob->string_stream->total_size;
1801 header_stream = XCNEW (struct lto_output_stream);
1802 lto_output_data_stream (header_stream, &header, sizeof header);
1803 lto_write_stream (header_stream);
1804 free (header_stream);
1806 /* Put all of the gimple and the string table out the asm file as a
1808 if (section_type == LTO_section_function_body)
1809 lto_write_stream (ob->cfg_stream);
1810 lto_write_stream (ob->main_stream);
1811 lto_write_stream (ob->string_stream);
1817 /* Output the body of function NODE->DECL. */
1820 output_function (struct cgraph_node *node)
1822 struct bitpack_d *bp;
1824 struct function *fn;
1826 struct output_block *ob;
1828 function = node->decl;
1829 fn = DECL_STRUCT_FUNCTION (function);
1830 ob = create_output_block (LTO_section_function_body);
1832 clear_line_info (ob);
1833 ob->cgraph_node = node;
1835 gcc_assert (current_function_decl == NULL_TREE && cfun == NULL);
1837 /* Set current_function_decl and cfun. */
1838 current_function_decl = function;
1841 /* Make string 0 be a NULL string. */
1842 lto_output_1_stream (ob->string_stream, 0);
1844 output_record_start (ob, LTO_function);
1846 /* Write all the attributes for FN. */
1847 bp = bitpack_create ();
1848 bp_pack_value (bp, fn->is_thunk, 1);
1849 bp_pack_value (bp, fn->has_local_explicit_reg_vars, 1);
1850 bp_pack_value (bp, fn->after_tree_profile, 1);
1851 bp_pack_value (bp, fn->returns_pcc_struct, 1);
1852 bp_pack_value (bp, fn->returns_struct, 1);
1853 bp_pack_value (bp, fn->always_inline_functions_inlined, 1);
1854 bp_pack_value (bp, fn->after_inlining, 1);
1855 bp_pack_value (bp, fn->dont_save_pending_sizes_p, 1);
1856 bp_pack_value (bp, fn->stdarg, 1);
1857 bp_pack_value (bp, fn->has_nonlocal_label, 1);
1858 bp_pack_value (bp, fn->calls_alloca, 1);
1859 bp_pack_value (bp, fn->calls_setjmp, 1);
1860 bp_pack_value (bp, fn->function_frequency, 2);
1861 bp_pack_value (bp, fn->va_list_fpr_size, 8);
1862 bp_pack_value (bp, fn->va_list_gpr_size, 8);
1863 lto_output_bitpack (ob->main_stream, bp);
1864 bitpack_delete (bp);
1866 /* Output the static chain and non-local goto save area. */
1867 lto_output_tree_ref (ob, fn->static_chain_decl);
1868 lto_output_tree_ref (ob, fn->nonlocal_goto_save_area);
1870 /* Output all the local variables in the function. */
1871 lto_output_tree_ref (ob, fn->local_decls);
1873 /* Output all the SSA names used in the function. */
1874 output_ssa_names (ob, fn);
1876 /* Output any exception handling regions. */
1877 output_eh_regions (ob, fn);
1879 /* Output DECL_INITIAL for the function, which contains the tree of
1881 lto_output_tree (ob, DECL_INITIAL (function), true);
1883 /* Output the head of the arguments list. */
1884 lto_output_tree_ref (ob, DECL_ARGUMENTS (function));
1886 /* We will renumber the statements. The code that does this uses
1887 the same ordering that we use for serializing them so we can use
1888 the same code on the other end and not have to write out the
1889 statement numbers. */
1890 renumber_gimple_stmt_uids ();
1892 /* Output the code for the function. */
1893 FOR_ALL_BB_FN (bb, fn)
1894 output_bb (ob, bb, fn);
1896 /* The terminator for this function. */
1899 output_cfg (ob, fn);
1901 /* Create a section to hold the pickled output of this function. */
1902 produce_asm (ob, function);
1904 destroy_output_block (ob);
1906 current_function_decl = NULL;
1911 /* Return true if alias pair P belongs to the set of cgraph nodes in
1912 SET. If P is a an alias for a VAR_DECL, it can always be emitted.
1913 However, for FUNCTION_DECL aliases, we should only output the pair
1914 if it belongs to a function whose cgraph node is in SET.
1915 Otherwise, the LTRANS phase will get into trouble when finalizing
1916 aliases because the alias will refer to a function not defined in
1917 the file processed by LTRANS. */
1920 output_alias_pair_p (alias_pair *p, cgraph_node_set set)
1922 cgraph_node_set_iterator csi;
1923 struct cgraph_node *target_node;
1925 /* Always emit VAR_DECLs. FIXME lto, we should probably only emit
1926 those VAR_DECLs that are instantiated in this file partition, but
1927 we have no easy way of knowing this based on SET. */
1928 if (TREE_CODE (p->decl) == VAR_DECL)
1931 /* Check if the assembler name for P->TARGET has its cgraph node in SET. */
1932 gcc_assert (TREE_CODE (p->decl) == FUNCTION_DECL);
1933 target_node = cgraph_node_for_asm (p->target);
1934 csi = cgraph_node_set_find (set, target_node);
1935 return (!csi_end_p (csi));
1939 /* Output any unreferenced global symbol defined in SET, alias pairs
1943 output_unreferenced_globals (cgraph_node_set set)
1945 struct output_block *ob;
1948 struct varpool_node *vnode;
1950 ob = create_output_block (LTO_section_static_initializer);
1951 ob->cgraph_node = NULL;
1953 clear_line_info (ob);
1955 /* Make string 0 be a NULL string. */
1956 lto_output_1_stream (ob->string_stream, 0);
1958 /* Emit references for all the global symbols. If a global symbol
1959 was never referenced in any of the functions of this file, it
1960 would not be emitted otherwise. This will result in unreferenced
1961 symbols at link time if a file defines a global symbol but
1962 never references it. */
1963 FOR_EACH_STATIC_VARIABLE (vnode)
1965 tree var = vnode->decl;
1967 if (TREE_CODE (var) == VAR_DECL && TREE_PUBLIC (var))
1968 lto_output_tree_ref (ob, var);
1973 /* Emit the alias pairs for the nodes in SET. */
1974 for (i = 0; VEC_iterate (alias_pair, alias_pairs, i, p); i++)
1976 if (output_alias_pair_p (p, set))
1978 lto_output_tree_ref (ob, p->decl);
1979 lto_output_tree_ref (ob, p->target);
1985 produce_asm (ob, NULL);
1986 destroy_output_block (ob);
1990 /* Copy the function body of NODE without deserializing. */
1993 copy_function (struct cgraph_node *node)
1995 tree function = node->decl;
1996 struct lto_file_decl_data *file_data = node->local.lto_file_data;
1997 struct lto_output_stream *output_stream = XCNEW (struct lto_output_stream);
2000 const char *name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (function));
2001 char *section_name =
2002 lto_get_section_name (LTO_section_function_body, name);
2004 struct lto_in_decl_state *in_state;
2005 struct lto_out_decl_state *out_state = lto_get_out_decl_state ();
2007 lto_begin_section (section_name, !flag_wpa);
2008 free (section_name);
2010 /* We may have renamed the declaration, e.g., a static function. */
2011 name = lto_get_decl_name_mapping (file_data, name);
2013 data = lto_get_section_data (file_data, LTO_section_function_body,
2017 /* Do a bit copy of the function body. */
2018 lto_output_data_stream (output_stream, data, len);
2019 lto_write_stream (output_stream);
2023 lto_get_function_in_decl_state (node->local.lto_file_data, function);
2024 gcc_assert (in_state);
2026 for (i = 0; i < LTO_N_DECL_STREAMS; i++)
2028 size_t n = in_state->streams[i].size;
2029 tree *trees = in_state->streams[i].trees;
2030 struct lto_tree_ref_encoder *encoder = &(out_state->streams[i]);
2032 /* The out state must have the same indices and the in state.
2033 So just copy the vector. All the encoders in the in state
2034 must be empty where we reach here. */
2035 gcc_assert (lto_tree_ref_encoder_size (encoder) == 0);
2036 for (j = 0; j < n; j++)
2037 VEC_safe_push (tree, heap, encoder->trees, trees[j]);
2038 encoder->next_index = n;
2041 lto_free_section_data (file_data, LTO_section_function_body, name,
2043 free (output_stream);
2048 /* Initialize the LTO writer. */
2051 lto_writer_init (void)
2053 lto_streamer_init ();
2057 /* Main entry point from the pass manager. */
2060 lto_output (cgraph_node_set set)
2062 struct cgraph_node *node;
2063 struct lto_out_decl_state *decl_state;
2064 cgraph_node_set_iterator csi;
2065 bitmap output = lto_bitmap_alloc ();
2069 /* Process only the functions with bodies. */
2070 for (csi = csi_start (set); !csi_end_p (csi); csi_next (&csi))
2072 node = csi_node (csi);
2073 if (node->analyzed && !bitmap_bit_p (output, DECL_UID (node->decl)))
2075 bitmap_set_bit (output, DECL_UID (node->decl));
2076 decl_state = lto_new_out_decl_state ();
2077 lto_push_out_decl_state (decl_state);
2079 output_function (node);
2081 copy_function (node);
2082 gcc_assert (lto_get_out_decl_state () == decl_state);
2083 lto_pop_out_decl_state ();
2084 lto_record_function_out_decl_state (node->decl, decl_state);
2088 /* Emit the callgraph after emitting function bodies. This needs to
2089 be done now to make sure that all the statements in every function
2090 have been renumbered so that edges can be associated with call
2091 statements using the statement UIDs. */
2092 output_cgraph (set);
2094 lto_bitmap_free (output);
2097 struct ipa_opt_pass_d pass_ipa_lto_gimple_out =
2101 "lto_gimple_out", /* name */
2102 gate_lto_out, /* gate */
2106 0, /* static_pass_number */
2107 TV_IPA_LTO_GIMPLE_IO, /* tv_id */
2108 0, /* properties_required */
2109 0, /* properties_provided */
2110 0, /* properties_destroyed */
2111 0, /* todo_flags_start */
2112 TODO_dump_func /* todo_flags_finish */
2114 NULL, /* generate_summary */
2115 lto_output, /* write_summary */
2116 NULL, /* read_summary */
2117 NULL, /* function_read_summary */
2119 NULL, /* function_transform */
2120 NULL /* variable_transform */
2124 /* Write each node in encoded by ENCODER to OB, as well as those reachable
2125 from it and required for correct representation of its semantics.
2126 Each node in ENCODER must be a global declaration or a type. A node
2127 is written only once, even if it appears multiple times in the
2128 vector. Certain transitively-reachable nodes, such as those
2129 representing expressions, may be duplicated, but such nodes
2130 must not appear in ENCODER itself. */
2133 write_global_stream (struct output_block *ob,
2134 struct lto_tree_ref_encoder *encoder)
2138 const size_t size = lto_tree_ref_encoder_size (encoder);
2140 for (index = 0; index < size; index++)
2142 t = lto_tree_ref_encoder_get_tree (encoder, index);
2143 if (!lto_streamer_cache_lookup (ob->writer_cache, t, NULL))
2147 /* In WPA we should not emit multiple definitions of the
2148 same symbol to all the files in the link set. If
2149 T had already been emitted as the pervailing definition
2150 in one file, emit it as an external reference in the
2152 /* FIXME lto. We should check if T belongs to the
2153 file we are writing to. */
2154 if (TREE_CODE (t) == VAR_DECL
2156 && !DECL_EXTERNAL (t))
2158 /* FIXME lto. Make DECLS_ALREADY_EMITTED an argument
2159 to this function so it can be freed up afterwards.
2160 Alternately, assign global symbols to cgraph
2162 static struct pointer_set_t *decls_already_emitted = NULL;
2164 if (decls_already_emitted == NULL)
2165 decls_already_emitted = pointer_set_create ();
2167 if (pointer_set_insert (decls_already_emitted, t))
2168 make_decl_one_only (t, DECL_ASSEMBLER_NAME (t));
2172 lto_output_tree (ob, t, false);
2178 /* Write a sequence of indices into the globals vector corresponding
2179 to the trees in ENCODER. These are used by the reader to map the
2180 indices used to refer to global entities within function bodies to
2184 write_global_references (struct output_block *ob,
2185 struct lto_output_stream *ref_stream,
2186 struct lto_tree_ref_encoder *encoder)
2190 const int32_t size = lto_tree_ref_encoder_size (encoder);
2192 /* Write size as 32-bit unsigned. */
2193 lto_output_data_stream (ref_stream, &size, sizeof (int32_t));
2195 for (index = 0; index < size; index++)
2199 t = lto_tree_ref_encoder_get_tree (encoder, index);
2200 lto_streamer_cache_lookup (ob->writer_cache, t, &slot_num);
2201 gcc_assert (slot_num >= 0);
2202 lto_output_data_stream (ref_stream, &slot_num, sizeof slot_num);
2207 /* Write all the streams in an lto_out_decl_state STATE using
2208 output block OB and output stream OUT_STREAM. */
2211 lto_output_decl_state_streams (struct output_block *ob,
2212 struct lto_out_decl_state *state)
2216 for (i = 0; i < LTO_N_DECL_STREAMS; i++)
2217 write_global_stream (ob, &state->streams[i]);
2221 /* Write all the references in an lto_out_decl_state STATE using
2222 output block OB and output stream OUT_STREAM. */
2225 lto_output_decl_state_refs (struct output_block *ob,
2226 struct lto_output_stream *out_stream,
2227 struct lto_out_decl_state *state)
2233 /* Write reference to FUNCTION_DECL. If there is not function,
2234 write reference to void_type_node. */
2235 decl = (state->fn_decl) ? state->fn_decl : void_type_node;
2236 lto_streamer_cache_lookup (ob->writer_cache, decl, &ref);
2237 gcc_assert (ref >= 0);
2238 lto_output_data_stream (out_stream, &ref, sizeof (int32_t));
2240 for (i = 0; i < LTO_N_DECL_STREAMS; i++)
2241 write_global_references (ob, out_stream, &state->streams[i]);
2245 /* Return the written size of STATE. */
2248 lto_out_decl_state_written_size (struct lto_out_decl_state *state)
2253 size = sizeof (int32_t); /* fn_ref. */
2254 for (i = 0; i < LTO_N_DECL_STREAMS; i++)
2256 size += sizeof (int32_t); /* vector size. */
2257 size += (lto_tree_ref_encoder_size (&state->streams[i])
2258 * sizeof (int32_t));
2264 /* Helper function of write_symbols_of_kind. CACHE is the streamer
2265 cache with all the pickled nodes. STREAM is the stream where to
2266 write the table. V is a vector with the DECLs that should be on
2267 the table. SEEN is a bitmap of symbols written so far. */
2270 write_symbol_vec (struct lto_streamer_cache_d *cache,
2271 struct lto_output_stream *stream,
2272 VEC(tree,heap) *v, bitmap seen)
2277 for (index = 0; VEC_iterate(tree, v, index, t); index++)
2280 enum gcc_plugin_symbol_kind kind;
2281 enum gcc_plugin_symbol_visibility visibility;
2286 /* None of the following kinds of symbols are needed in the
2288 if (!TREE_PUBLIC (t)
2289 || is_builtin_fn (t)
2290 || DECL_ABSTRACT (t)
2291 || TREE_CODE (t) == RESULT_DECL)
2294 gcc_assert (TREE_CODE (t) == VAR_DECL
2295 || TREE_CODE (t) == FUNCTION_DECL);
2297 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (t));
2299 /* FIXME lto: this is from assemble_name_raw in varasm.c. For some
2300 architectures we might have to do the same name manipulations that
2301 ASM_OUTPUT_LABELREF does. */
2305 lto_streamer_cache_lookup (cache, t, &slot_num);
2306 gcc_assert (slot_num >= 0);
2308 /* Avoid duplicate symbols. */
2309 if (bitmap_bit_p (seen, slot_num))
2312 bitmap_set_bit (seen, slot_num);
2314 if (DECL_EXTERNAL (t))
2317 kind = GCCPK_WEAKUNDEF;
2324 kind = GCCPK_WEAKDEF;
2325 else if (DECL_COMMON (t))
2326 kind = GCCPK_COMMON;
2331 switch (DECL_VISIBILITY(t))
2333 case VISIBILITY_DEFAULT:
2334 visibility = GCCPV_DEFAULT;
2336 case VISIBILITY_PROTECTED:
2337 visibility = GCCPV_PROTECTED;
2339 case VISIBILITY_HIDDEN:
2340 visibility = GCCPV_HIDDEN;
2342 case VISIBILITY_INTERNAL:
2343 visibility = GCCPV_INTERNAL;
2347 if (kind == GCCPK_COMMON && DECL_SIZE (t))
2348 size = (((uint64_t) TREE_INT_CST_HIGH (DECL_SIZE (t))) << 32)
2349 | TREE_INT_CST_LOW (DECL_SIZE (t));
2353 if (DECL_ONE_ONLY (t))
2354 comdat = IDENTIFIER_POINTER (DECL_COMDAT_GROUP (t));
2358 lto_output_data_stream (stream, name, strlen (name) + 1);
2359 lto_output_data_stream (stream, comdat, strlen (comdat) + 1);
2360 lto_output_data_stream (stream, &kind, 1);
2361 lto_output_data_stream (stream, &visibility, 1);
2362 lto_output_data_stream (stream, &size, 8);
2363 lto_output_data_stream (stream, &slot_num, 4);
2368 /* Write IL symbols of KIND. CACHE is the streamer cache with all the
2369 pickled nodes. SEEN is a bitmap of symbols written so far. */
2372 write_symbols_of_kind (lto_decl_stream_e_t kind,
2373 struct lto_streamer_cache_d *cache, bitmap seen)
2375 struct lto_out_decl_state *out_state;
2376 struct lto_output_stream stream;
2378 VEC_length (lto_out_decl_state_ptr, lto_function_decl_states);
2381 memset (&stream, 0, sizeof (stream));
2382 out_state = lto_get_out_decl_state ();
2383 write_symbol_vec (cache, &stream, out_state->streams[kind].trees, seen);
2385 for (idx = 0; idx < num_fns; idx++)
2388 VEC_index (lto_out_decl_state_ptr, lto_function_decl_states, idx);
2389 write_symbol_vec (cache, &stream, out_state->streams[kind].trees, seen);
2392 lto_write_stream (&stream);
2396 /* Write an IL symbol table. CACHE is the streamer cache with all the
2400 produce_symtab (struct lto_streamer_cache_d *cache)
2402 char *section_name = lto_get_section_name (LTO_section_symtab, NULL);
2405 lto_begin_section (section_name, false);
2406 free (section_name);
2408 seen = lto_bitmap_alloc ();
2409 write_symbols_of_kind (LTO_DECL_STREAM_FN_DECL, cache, seen);
2410 write_symbols_of_kind (LTO_DECL_STREAM_VAR_DECL, cache, seen);
2411 lto_bitmap_free (seen);
2417 /* This pass is run after all of the functions are serialized and all
2418 of the IPA passes have written their serialized forms. This pass
2419 causes the vector of all of the global decls and types used from
2420 this file to be written in to a section that can then be read in to
2421 recover these on other side. */
2424 produce_asm_for_decls (cgraph_node_set set)
2426 struct lto_out_decl_state *out_state;
2427 struct lto_out_decl_state *fn_out_state;
2428 struct lto_decl_header header;
2430 struct output_block *ob;
2431 struct lto_output_stream *header_stream, *decl_state_stream;
2432 unsigned idx, num_fns;
2433 size_t decl_state_size;
2434 int32_t num_decl_states;
2436 ob = create_output_block (LTO_section_decls);
2439 /* Write out unreferenced globals, alias pairs and labels. We defer
2440 doing this until now so that we can write out only what is
2442 output_unreferenced_globals (set);
2444 memset (&header, 0, sizeof (struct lto_decl_header));
2446 section_name = lto_get_section_name (LTO_section_decls, NULL);
2447 lto_begin_section (section_name, !flag_wpa);
2448 free (section_name);
2450 /* Make string 0 be a NULL string. */
2451 lto_output_1_stream (ob->string_stream, 0);
2453 /* Write the global symbols. */
2454 out_state = lto_get_out_decl_state ();
2455 num_fns = VEC_length (lto_out_decl_state_ptr, lto_function_decl_states);
2456 lto_output_decl_state_streams (ob, out_state);
2457 for (idx = 0; idx < num_fns; idx++)
2460 VEC_index (lto_out_decl_state_ptr, lto_function_decl_states, idx);
2461 lto_output_decl_state_streams (ob, fn_out_state);
2464 header.lto_header.major_version = LTO_major_version;
2465 header.lto_header.minor_version = LTO_minor_version;
2466 header.lto_header.section_type = LTO_section_decls;
2468 /* Currently not used. This field would allow us to preallocate
2469 the globals vector, so that it need not be resized as it is extended. */
2470 header.num_nodes = -1;
2472 /* Compute the total size of all decl out states. */
2473 decl_state_size = sizeof (int32_t);
2474 decl_state_size += lto_out_decl_state_written_size (out_state);
2475 for (idx = 0; idx < num_fns; idx++)
2478 VEC_index (lto_out_decl_state_ptr, lto_function_decl_states, idx);
2479 decl_state_size += lto_out_decl_state_written_size (fn_out_state);
2481 header.decl_state_size = decl_state_size;
2483 header.main_size = ob->main_stream->total_size;
2484 header.string_size = ob->string_stream->total_size;
2486 header_stream = XCNEW (struct lto_output_stream);
2487 lto_output_data_stream (header_stream, &header, sizeof header);
2488 lto_write_stream (header_stream);
2489 free (header_stream);
2491 /* Write the main out-decl state, followed by out-decl states of
2493 decl_state_stream = ((struct lto_output_stream *)
2494 xcalloc (1, sizeof (struct lto_output_stream)));
2495 num_decl_states = num_fns + 1;
2496 lto_output_data_stream (decl_state_stream, &num_decl_states,
2497 sizeof (num_decl_states));
2498 lto_output_decl_state_refs (ob, decl_state_stream, out_state);
2499 for (idx = 0; idx < num_fns; idx++)
2502 VEC_index (lto_out_decl_state_ptr, lto_function_decl_states, idx);
2503 lto_output_decl_state_refs (ob, decl_state_stream, fn_out_state);
2505 lto_write_stream (decl_state_stream);
2506 free(decl_state_stream);
2508 lto_write_stream (ob->main_stream);
2509 lto_write_stream (ob->string_stream);
2513 /* Write the symbol table. */
2514 produce_symtab (ob->writer_cache);
2516 /* Write command line opts. */
2517 lto_write_options ();
2519 /* Deallocate memory and clean up. */
2520 lto_cgraph_encoder_delete (ob->decl_state->cgraph_node_encoder);
2521 VEC_free (lto_out_decl_state_ptr, heap, lto_function_decl_states);
2522 lto_function_decl_states = NULL;
2523 destroy_output_block (ob);
2527 struct ipa_opt_pass_d pass_ipa_lto_finish_out =
2531 "lto_decls_out", /* name */
2532 gate_lto_out, /* gate */
2536 0, /* static_pass_number */
2537 TV_IPA_LTO_DECL_IO, /* tv_id */
2538 0, /* properties_required */
2539 0, /* properties_provided */
2540 0, /* properties_destroyed */
2541 0, /* todo_flags_start */
2542 0 /* todo_flags_finish */
2544 NULL, /* generate_summary */
2545 produce_asm_for_decls, /* write_summary */
2546 NULL, /* read_summary */
2547 NULL, /* function_read_summary */
2549 NULL, /* function_transform */
2550 NULL /* variable_transform */