1 /* Miscellaneous utilities for GIMPLE streaming. Things that are used
2 in both input and output are here.
4 Copyright 2009 Free Software Foundation, Inc.
5 Contributed by Doug Kwan <dougkwan@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"
31 #include "tree-flow.h"
32 #include "diagnostic.h"
35 #include "lto-streamer.h"
37 /* Statistics gathered during LTO, WPA and LTRANS. */
38 struct lto_stats_d lto_stats;
40 /* LTO uses bitmaps with different life-times. So use a seperate
41 obstack for all LTO bitmaps. */
42 static bitmap_obstack lto_obstack;
43 static bool lto_obstack_initialized;
46 /* Return a string representing LTO tag TAG. */
49 lto_tag_name (enum LTO_tags tag)
51 if (lto_tag_is_tree_code_p (tag))
53 /* For tags representing tree nodes, return the name of the
54 associated tree code. */
55 return tree_code_name[lto_tag_to_tree_code (tag)];
58 if (lto_tag_is_gimple_code_p (tag))
60 /* For tags representing gimple statements, return the name of
61 the associated gimple code. */
62 return gimple_code_name[lto_tag_to_gimple_code (tag)];
74 return "LTO_eh_region";
76 return "LTO_function";
78 return "LTO_eh_table";
80 return "LTO_ert_cleanup";
83 case LTO_ert_allowed_exceptions:
84 return "LTO_ert_allowed_exceptions";
85 case LTO_ert_must_not_throw:
86 return "LTO_ert_must_not_throw";
87 case LTO_tree_pickle_reference:
88 return "LTO_tree_pickle_reference";
89 case LTO_field_decl_ref:
90 return "LTO_field_decl_ref";
91 case LTO_function_decl_ref:
92 return "LTO_function_decl_ref";
93 case LTO_label_decl_ref:
94 return "LTO_label_decl_ref";
95 case LTO_namespace_decl_ref:
96 return "LTO_namespace_decl_ref";
97 case LTO_result_decl_ref:
98 return "LTO_result_decl_ref";
99 case LTO_ssa_name_ref:
100 return "LTO_ssa_name_ref";
101 case LTO_type_decl_ref:
102 return "LTO_type_decl_ref";
104 return "LTO_type_ref";
105 case LTO_global_decl_ref:
106 return "LTO_global_decl_ref";
108 return "LTO_UNKNOWN";
113 /* Allocate a bitmap from heap. Initializes the LTO obstack if necessary. */
116 lto_bitmap_alloc (void)
118 if (!lto_obstack_initialized)
120 bitmap_obstack_initialize (<o_obstack);
121 lto_obstack_initialized = true;
123 return BITMAP_ALLOC (<o_obstack);
129 lto_bitmap_free (bitmap b)
135 /* Get a section name for a particular type or name. The NAME field
136 is only used if SECTION_TYPE is LTO_section_function_body or
137 LTO_static_initializer. For all others it is ignored. The callee
138 of this function is responcible to free the returned name. */
141 lto_get_section_name (int section_type, const char *name)
143 switch (section_type)
145 case LTO_section_function_body:
146 return concat (LTO_SECTION_NAME_PREFIX, name, NULL);
148 case LTO_section_static_initializer:
149 return concat (LTO_SECTION_NAME_PREFIX, ".statics", NULL);
151 case LTO_section_symtab:
152 return concat (LTO_SECTION_NAME_PREFIX, ".symtab", NULL);
154 case LTO_section_decls:
155 return concat (LTO_SECTION_NAME_PREFIX, ".decls", NULL);
157 case LTO_section_cgraph:
158 return concat (LTO_SECTION_NAME_PREFIX, ".cgraph", NULL);
160 case LTO_section_ipa_pure_const:
161 return concat (LTO_SECTION_NAME_PREFIX, ".pureconst", NULL);
163 case LTO_section_ipa_reference:
164 return concat (LTO_SECTION_NAME_PREFIX, ".reference", NULL);
166 case LTO_section_wpa_fixup:
167 return concat (LTO_SECTION_NAME_PREFIX, ".wpa_fixup", NULL);
169 case LTO_section_opts:
170 return concat (LTO_SECTION_NAME_PREFIX, ".opts", NULL);
173 internal_error ("bytecode stream: unexpected LTO section %s", name);
178 /* Show various memory usage statistics related to LTO. */
181 print_lto_report (void)
183 const char *s = (flag_lto) ? "LTO" : (flag_wpa) ? "WPA" : "LTRANS";
186 fprintf (stderr, "%s statistics\n", s);
187 fprintf (stderr, "[%s] # of input files: "
188 HOST_WIDE_INT_PRINT_UNSIGNED "\n", s, lto_stats.num_input_files);
190 fprintf (stderr, "[%s] # of input cgraph nodes: "
191 HOST_WIDE_INT_PRINT_UNSIGNED "\n", s,
192 lto_stats.num_input_cgraph_nodes);
194 fprintf (stderr, "[%s] # of function bodies: "
195 HOST_WIDE_INT_PRINT_UNSIGNED "\n", s,
196 lto_stats.num_function_bodies);
198 fprintf (stderr, "[%s] ", s);
199 print_gimple_types_stats ();
201 for (i = 0; i < NUM_TREE_CODES; i++)
202 if (lto_stats.num_trees[i])
203 fprintf (stderr, "[%s] # of '%s' objects read: "
204 HOST_WIDE_INT_PRINT_UNSIGNED "\n", s,
205 tree_code_name[i], lto_stats.num_trees[i]);
209 fprintf (stderr, "[%s] Compression: "
210 HOST_WIDE_INT_PRINT_UNSIGNED " output bytes, "
211 HOST_WIDE_INT_PRINT_UNSIGNED " compressed bytes", s,
212 lto_stats.num_output_il_bytes,
213 lto_stats.num_compressed_il_bytes);
214 if (lto_stats.num_output_il_bytes > 0)
216 const float dividend = (float) lto_stats.num_compressed_il_bytes;
217 const float divisor = (float) lto_stats.num_output_il_bytes;
218 fprintf (stderr, " (ratio: %f)", dividend / divisor);
220 fprintf (stderr, "\n");
225 fprintf (stderr, "[%s] # of output files: "
226 HOST_WIDE_INT_PRINT_UNSIGNED "\n", s,
227 lto_stats.num_output_files);
229 fprintf (stderr, "[%s] # of output cgraph nodes: "
230 HOST_WIDE_INT_PRINT_UNSIGNED "\n", s,
231 lto_stats.num_output_cgraph_nodes);
233 fprintf (stderr, "[%s] # callgraph partitions: "
234 HOST_WIDE_INT_PRINT_UNSIGNED "\n", s,
235 lto_stats.num_cgraph_partitions);
237 fprintf (stderr, "[%s] Compression: "
238 HOST_WIDE_INT_PRINT_UNSIGNED " input bytes, "
239 HOST_WIDE_INT_PRINT_UNSIGNED " uncompressed bytes", s,
240 lto_stats.num_input_il_bytes,
241 lto_stats.num_uncompressed_il_bytes);
242 if (lto_stats.num_input_il_bytes > 0)
244 const float dividend = (float) lto_stats.num_uncompressed_il_bytes;
245 const float divisor = (float) lto_stats.num_input_il_bytes;
246 fprintf (stderr, " (ratio: %f)", dividend / divisor);
248 fprintf (stderr, "\n");
251 for (i = 0; i < LTO_N_SECTION_TYPES; i++)
252 fprintf (stderr, "[%s] Size of mmap'd section %s: "
253 HOST_WIDE_INT_PRINT_UNSIGNED " bytes\n", s,
254 lto_section_name[i], lto_stats.section_size[i]);
258 /* Create a new bitpack. */
261 bitpack_create (void)
263 return XCNEW (struct bitpack_d);
267 /* Free the memory used by bitpack BP. */
270 bitpack_delete (struct bitpack_d *bp)
272 VEC_free (bitpack_word_t, heap, bp->values);
277 /* Return an index to the word in bitpack BP that contains the
280 static inline unsigned
281 bp_get_next_word (struct bitpack_d *bp, unsigned nbits)
285 /* In principle, the next word to use is determined by the
286 number of bits already processed in BP. */
287 ix = bp->num_bits / BITS_PER_BITPACK_WORD;
289 /* All the encoded bit patterns in BP are contiguous, therefore if
290 the next NBITS would straddle over two different words, move the
291 index to the next word and update the number of encoded bits
292 by adding up the hole of unused bits created by this move. */
293 bp->first_unused_bit %= BITS_PER_BITPACK_WORD;
294 last = bp->first_unused_bit + nbits - 1;
295 if (last >= BITS_PER_BITPACK_WORD)
298 bp->num_bits += (BITS_PER_BITPACK_WORD - bp->first_unused_bit);
299 bp->first_unused_bit = 0;
306 /* Pack NBITS of value VAL into bitpack BP. */
309 bp_pack_value (struct bitpack_d *bp, bitpack_word_t val, unsigned nbits)
314 /* We cannot encode more bits than BITS_PER_BITPACK_WORD. */
315 gcc_assert (nbits > 0 && nbits <= BITS_PER_BITPACK_WORD);
317 /* Compute which word will contain the next NBITS. */
318 ix = bp_get_next_word (bp, nbits);
319 if (ix >= VEC_length (bitpack_word_t, bp->values))
321 /* If there is no room left in the last word of the values
322 array, add a new word. Additionally, we should only
323 need to add a single word, since every pack operation cannot
324 use more bits than fit in a single word. */
325 gcc_assert (ix < VEC_length (bitpack_word_t, bp->values) + 1);
326 VEC_safe_push (bitpack_word_t, heap, bp->values, 0);
329 /* Grab the last word to pack VAL into. */
330 word = VEC_index (bitpack_word_t, bp->values, ix);
332 /* To fit VAL in WORD, we need to shift VAL to the left to
333 skip the bottom BP->FIRST_UNUSED_BIT bits. */
334 gcc_assert (BITS_PER_BITPACK_WORD >= bp->first_unused_bit + nbits);
335 val <<= bp->first_unused_bit;
337 /* Update WORD with VAL. */
341 VEC_replace (bitpack_word_t, bp->values, ix, word);
342 bp->num_bits += nbits;
343 bp->first_unused_bit += nbits;
347 /* Unpack the next NBITS from bitpack BP. */
350 bp_unpack_value (struct bitpack_d *bp, unsigned nbits)
352 bitpack_word_t val, word, mask;
355 /* We cannot decode more bits than BITS_PER_BITPACK_WORD. */
356 gcc_assert (nbits > 0 && nbits <= BITS_PER_BITPACK_WORD);
358 /* Compute which word contains the next NBITS. */
359 ix = bp_get_next_word (bp, nbits);
360 word = VEC_index (bitpack_word_t, bp->values, ix);
362 /* Compute the mask to get NBITS from WORD. */
363 mask = (nbits == BITS_PER_BITPACK_WORD)
364 ? (bitpack_word_t) -1
365 : ((bitpack_word_t) 1 << nbits) - 1;
367 /* Shift WORD to the right to skip over the bits already decoded
369 word >>= bp->first_unused_bit;
371 /* Apply the mask to obtain the requested value. */
374 /* Update BP->NUM_BITS for the next unpack operation. */
375 bp->num_bits += nbits;
376 bp->first_unused_bit += nbits;
382 /* Check that all the TS_* structures handled by the lto_output_* and
383 lto_input_* routines are exactly ALL the structures defined in
387 check_handled_ts_structures (void)
389 bool handled_p[LAST_TS_ENUM];
392 memset (&handled_p, 0, sizeof (handled_p));
394 /* These are the TS_* structures that are either handled or
395 explicitly ignored by the streamer routines. */
396 handled_p[TS_BASE] = true;
397 handled_p[TS_COMMON] = true;
398 handled_p[TS_INT_CST] = true;
399 handled_p[TS_REAL_CST] = true;
400 handled_p[TS_FIXED_CST] = true;
401 handled_p[TS_VECTOR] = true;
402 handled_p[TS_STRING] = true;
403 handled_p[TS_COMPLEX] = true;
404 handled_p[TS_IDENTIFIER] = true;
405 handled_p[TS_DECL_MINIMAL] = true;
406 handled_p[TS_DECL_COMMON] = true;
407 handled_p[TS_DECL_WRTL] = true;
408 handled_p[TS_DECL_NON_COMMON] = true;
409 handled_p[TS_DECL_WITH_VIS] = true;
410 handled_p[TS_FIELD_DECL] = true;
411 handled_p[TS_VAR_DECL] = true;
412 handled_p[TS_PARM_DECL] = true;
413 handled_p[TS_LABEL_DECL] = true;
414 handled_p[TS_RESULT_DECL] = true;
415 handled_p[TS_CONST_DECL] = true;
416 handled_p[TS_TYPE_DECL] = true;
417 handled_p[TS_FUNCTION_DECL] = true;
418 handled_p[TS_TYPE] = true;
419 handled_p[TS_LIST] = true;
420 handled_p[TS_VEC] = true;
421 handled_p[TS_EXP] = true;
422 handled_p[TS_SSA_NAME] = true;
423 handled_p[TS_BLOCK] = true;
424 handled_p[TS_BINFO] = true;
425 handled_p[TS_STATEMENT_LIST] = true;
426 handled_p[TS_CONSTRUCTOR] = true;
427 handled_p[TS_OMP_CLAUSE] = true;
428 handled_p[TS_OPTIMIZATION] = true;
429 handled_p[TS_TARGET_OPTION] = true;
431 /* Anything not marked above will trigger the following assertion.
432 If this assertion triggers, it means that there is a new TS_*
433 structure that should be handled by the streamer. */
434 for (i = 0; i < LAST_TS_ENUM; i++)
435 gcc_assert (handled_p[i]);
439 /* Helper for lto_streamer_cache_insert_1. Add T to CACHE->NODES at
440 slot IX. Add OFFSET to CACHE->OFFSETS at slot IX. */
443 lto_streamer_cache_add_to_node_array (struct lto_streamer_cache_d *cache,
444 int ix, tree t, unsigned offset)
446 gcc_assert (ix >= 0);
448 /* Grow the array of nodes and offsets to accomodate T at IX. */
449 if (ix >= (int) VEC_length (tree, cache->nodes))
451 size_t sz = ix + (20 + ix) / 4;
452 VEC_safe_grow_cleared (tree, gc, cache->nodes, sz);
453 VEC_safe_grow_cleared (unsigned, heap, cache->offsets, sz);
456 VEC_replace (tree, cache->nodes, ix, t);
457 VEC_replace (unsigned, cache->offsets, ix, offset);
461 /* Helper for lto_streamer_cache_insert and lto_streamer_cache_insert_at.
462 CACHE, T, IX_P and OFFSET_P are as in lto_streamer_cache_insert.
464 If INSERT_AT_NEXT_SLOT_P is true, T is inserted at the next available
465 slot in the cache. Otherwise, T is inserted at the position indicated
468 If T already existed in CACHE, return true. Otherwise,
472 lto_streamer_cache_insert_1 (struct lto_streamer_cache_d *cache,
473 tree t, int *ix_p, unsigned *offset_p,
474 bool insert_at_next_slot_p)
477 struct tree_int_map d_entry, *entry;
484 d_entry.base.from = t;
485 slot = htab_find_slot (cache->node_map, &d_entry, INSERT);
488 /* Determine the next slot to use in the cache. */
489 if (insert_at_next_slot_p)
490 ix = cache->next_slot++;
494 entry = XCNEW (struct tree_int_map);
495 entry->base.from = t;
496 entry->to = (unsigned) ix;
499 /* If no offset was given, store the invalid offset -1. */
500 offset = (offset_p) ? *offset_p : (unsigned) -1;
502 lto_streamer_cache_add_to_node_array (cache, ix, t, offset);
504 /* Indicate that the item was not present in the cache. */
509 entry = (struct tree_int_map *) *slot;
510 ix = (int) entry->to;
511 offset = VEC_index (unsigned, cache->offsets, ix);
513 if (!insert_at_next_slot_p && ix != *ix_p)
515 /* If the caller wants to insert T at a specific slot
516 location, and ENTRY->TO does not match *IX_P, add T to
517 the requested location slot. This situation arises when
518 streaming builtin functions.
520 For instance, on the writer side we could have two
521 FUNCTION_DECLS T1 and T2 that are represented by the same
522 builtin function. The reader will only instantiate the
523 canonical builtin, but since T1 and T2 had been
524 originally stored in different cache slots (S1 and S2),
525 the reader must be able to find the canonical builtin
526 function at slots S1 and S2. */
527 gcc_assert (lto_stream_as_builtin_p (t));
530 /* Since we are storing a builtin, the offset into the
531 stream is not necessary as we will not need to read
532 forward in the stream. */
533 lto_streamer_cache_add_to_node_array (cache, ix, t, -1);
536 /* Indicate that T was already in the cache. */
550 /* Insert tree node T in CACHE. If T already existed in the cache
551 return true. Otherwise, return false.
553 If IX_P is non-null, update it with the index into the cache where
556 *OFFSET_P represents the offset in the stream where T is physically
557 written out. The first time T is added to the cache, *OFFSET_P is
558 recorded in the cache together with T. But if T already existed
559 in the cache, *OFFSET_P is updated with the value that was recorded
560 the first time T was added to the cache.
562 If OFFSET_P is NULL, it is ignored. */
565 lto_streamer_cache_insert (struct lto_streamer_cache_d *cache, tree t,
566 int *ix_p, unsigned *offset_p)
568 return lto_streamer_cache_insert_1 (cache, t, ix_p, offset_p, true);
572 /* Insert tree node T in CACHE at slot IX. If T already
573 existed in the cache return true. Otherwise, return false. */
576 lto_streamer_cache_insert_at (struct lto_streamer_cache_d *cache,
579 return lto_streamer_cache_insert_1 (cache, t, &ix, NULL, false);
583 /* Return true if tree node T exists in CACHE. If IX_P is
584 not NULL, write to *IX_P the index into the cache where T is stored
585 (-1 if T is not found). */
588 lto_streamer_cache_lookup (struct lto_streamer_cache_d *cache, tree t,
592 struct tree_int_map d_slot;
598 d_slot.base.from = t;
599 slot = htab_find_slot (cache->node_map, &d_slot, NO_INSERT);
608 ix = (int) ((struct tree_int_map *) *slot)->to;
618 /* Return the tree node at slot IX in CACHE. */
621 lto_streamer_cache_get (struct lto_streamer_cache_d *cache, int ix)
625 /* If the reader is requesting an index beyond the length of the
626 cache, it will need to read ahead. Return NULL_TREE to indicate
628 if ((unsigned) ix >= VEC_length (tree, cache->nodes))
631 return VEC_index (tree, cache->nodes, (unsigned) ix);
635 /* Record NODE in COMMON_NODES if it is not NULL and is not already in
639 lto_record_common_node (tree *nodep, VEC(tree, heap) **common_nodes,
640 struct pointer_set_t *seen_nodes)
644 if (node == NULL_TREE)
648 *nodep = node = gimple_register_type (node);
650 /* Return if node is already seen. */
651 if (pointer_set_insert (seen_nodes, node))
654 VEC_safe_push (tree, heap, *common_nodes, node);
656 if (tree_node_can_be_shared (node))
658 if (POINTER_TYPE_P (node)
659 || TREE_CODE (node) == COMPLEX_TYPE
660 || TREE_CODE (node) == ARRAY_TYPE)
661 lto_record_common_node (&TREE_TYPE (node), common_nodes, seen_nodes);
666 /* Generate a vector of common nodes and make sure they are merged
667 properly according to the the gimple type table. */
669 static VEC(tree,heap) *
670 lto_get_common_nodes (void)
673 VEC(tree,heap) *common_nodes = NULL;
674 struct pointer_set_t *seen_nodes;
676 /* The MAIN_IDENTIFIER_NODE is normally set up by the front-end, but the
677 LTO back-end must agree. Currently, the only languages that set this
678 use the name "main". */
679 if (main_identifier_node)
681 const char *main_name = IDENTIFIER_POINTER (main_identifier_node);
682 gcc_assert (strcmp (main_name, "main") == 0);
685 main_identifier_node = get_identifier ("main");
687 gcc_assert (ptrdiff_type_node == integer_type_node);
689 /* FIXME lto. In the C++ front-end, fileptr_type_node is defined as a
690 variant copy of of ptr_type_node, rather than ptr_node itself. The
691 distinction should only be relevant to the front-end, so we always
692 use the C definition here in lto1.
694 These should be assured in pass_ipa_free_lang_data. */
695 gcc_assert (fileptr_type_node == ptr_type_node);
696 gcc_assert (TYPE_MAIN_VARIANT (fileptr_type_node) == ptr_type_node);
698 seen_nodes = pointer_set_create ();
700 /* Skip itk_char. char_type_node is shared with the appropriately
702 for (i = itk_signed_char; i < itk_none; i++)
703 lto_record_common_node (&integer_types[i], &common_nodes, seen_nodes);
705 for (i = 0; i < TYPE_KIND_LAST; i++)
706 lto_record_common_node (&sizetype_tab[i], &common_nodes, seen_nodes);
708 for (i = 0; i < TI_MAX; i++)
709 lto_record_common_node (&global_trees[i], &common_nodes, seen_nodes);
711 pointer_set_destroy (seen_nodes);
717 /* Assign an index to tree node T and enter it in the streamer cache
721 preload_common_node (struct lto_streamer_cache_d *cache, tree t)
725 lto_streamer_cache_insert (cache, t, NULL, NULL);
727 /* The FIELD_DECLs of structures should be shared, so that every
728 COMPONENT_REF uses the same tree node when referencing a field.
729 Pointer equality between FIELD_DECLs is used by the alias
730 machinery to compute overlapping memory references (See
731 nonoverlapping_component_refs_p). */
732 if (TREE_CODE (t) == RECORD_TYPE)
736 for (f = TYPE_FIELDS (t); f; f = TREE_CHAIN (f))
737 preload_common_node (cache, f);
742 /* Create a cache of pickled nodes. */
744 struct lto_streamer_cache_d *
745 lto_streamer_cache_create (void)
747 struct lto_streamer_cache_d *cache;
748 VEC(tree, heap) *common_nodes;
752 cache = XCNEW (struct lto_streamer_cache_d);
754 cache->node_map = htab_create (101, tree_int_map_hash, tree_int_map_eq, NULL);
756 /* Load all the well-known tree nodes that are always created by
757 the compiler on startup. This prevents writing them out
759 common_nodes = lto_get_common_nodes ();
761 for (i = 0; VEC_iterate (tree, common_nodes, i, node); i++)
762 preload_common_node (cache, node);
764 VEC_free(tree, heap, common_nodes);
770 /* Delete the streamer cache C. */
773 lto_streamer_cache_delete (struct lto_streamer_cache_d *c)
778 htab_delete (c->node_map);
779 VEC_free (tree, gc, c->nodes);
780 VEC_free (unsigned, heap, c->offsets);
785 /* Initialization common to the LTO reader and writer. */
788 lto_streamer_init (void)
790 /* Check that all the TS_* handled by the reader and writer routines
791 match exactly the structures defined in treestruct.def. When a
792 new TS_* astructure is added, the streamer should be updated to
794 check_handled_ts_structures ();
798 /* Gate function for all LTO streaming passes. */
803 return ((flag_generate_lto || in_lto_p)
804 /* Don't bother doing anything if the program has errors. */
805 && !(errorcount || sorrycount));
809 #ifdef LTO_STREAMER_DEBUG
810 /* Add a mapping between T and ORIG_T, which is the numeric value of
811 the original address of T as it was seen by the LTO writer. This
812 mapping is useful when debugging streaming problems. A debugging
813 session can be started on both reader and writer using ORIG_T
814 as a breakpoint value in both sessions.
816 Note that this mapping is transient and only valid while T is
817 being reconstructed. Once T is fully built, the mapping is
821 lto_orig_address_map (tree t, intptr_t orig_t)
823 /* FIXME lto. Using the annotation field is quite hacky as it relies
824 on the GC not running while T is being rematerialized. It would
825 be cleaner to use a hash table here. */
826 t->base.ann = (union tree_ann_d *) orig_t;
830 /* Get the original address of T as it was seen by the writer. This
831 is only valid while T is being reconstructed. */
834 lto_orig_address_get (tree t)
836 return (intptr_t) t->base.ann;
840 /* Clear the mapping of T to its original address. */
843 lto_orig_address_remove (tree t)
850 /* Check that the version MAJOR.MINOR is the correct version number. */
853 lto_check_version (int major, int minor)
855 if (major != LTO_major_version || minor != LTO_minor_version)
856 fatal_error ("bytecode stream generated with LTO version %d.%d instead "
857 "of the expected %d.%d",
859 LTO_major_version, LTO_minor_version);