gcc/tree-streamer-in.c

   1 /* Routines for reading trees from a file stream.
   2
   3    Copyright (C) 2011-2016 Free Software Foundation, Inc.
   4    Contributed by Diego Novillo <dnovillo@google.com>
   5
   6 This file is part of GCC.
   7
   8 GCC is free software; you can redistribute it and/or modify it under
   9 the terms of the GNU General Public License as published by the Free
  10 Software Foundation; either version 3, or (at your option) any later
  11 version.
  12
  13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
  14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
  15 FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  16 for more details.
  17
  18 You should have received a copy of the GNU General Public License
  19 along with GCC; see the file COPYING3.  If not see
  20 <http://www.gnu.org/licenses/>.  */
  21
  22 #include "config.h"
  23 #include "system.h"
  24 #include "coretypes.h"
  25 #include "backend.h"
  26 #include "target.h"
  27 #include "tree.h"
  28 #include "gimple.h"
  29 #include "stringpool.h"
  30 #include "tree-streamer.h"
  31 #include "cgraph.h"
  32 #include "builtins.h"
  33 #include "ipa-chkp.h"
  34 #include "gomp-constants.h"
  35 #include "asan.h"
  36
  37
  38 /* Read a STRING_CST from the string table in DATA_IN using input
  39    block IB.  */
  40
  41 tree
  42 streamer_read_string_cst (struct data_in *data_in, struct lto_input_block *ib)
  43 {
  44   unsigned int len;
  45   const char * ptr;
  46
  47   ptr = streamer_read_indexed_string (data_in, ib, &len);
  48   if (!ptr)
  49     return NULL;
  50   return build_string (len, ptr);
  51 }
  52
  53
  54 /* Read an IDENTIFIER from the string table in DATA_IN using input
  55    block IB.  */
  56
  57 static tree
  58 input_identifier (struct data_in *data_in, struct lto_input_block *ib)
  59 {
  60   unsigned int len;
  61   const char *ptr;
  62
  63   ptr = streamer_read_indexed_string (data_in, ib, &len);
  64   if (!ptr)
  65     return NULL;
  66   return get_identifier_with_length (ptr, len);
  67 }
  68
  69
  70 /* Read a chain of tree nodes from input block IB. DATA_IN contains
  71    tables and descriptors for the file being read.  */
  72
  73 tree
  74 streamer_read_chain (struct lto_input_block *ib, struct data_in *data_in)
  75 {
  76   tree first, prev, curr;
  77
  78   /* The chain is written as NULL terminated list of trees.  */
  79   first = prev = NULL_TREE;
  80   do
  81     {
  82       curr = stream_read_tree (ib, data_in);
  83       if (prev)
  84         TREE_CHAIN (prev) = curr;
  85       else
  86         first = curr;
  87
  88       prev = curr;
  89     }
  90   while (curr);
  91
  92   return first;
  93 }
  94
  95
  96 /* Unpack all the non-pointer fields of the TS_BASE structure of
  97    expression EXPR from bitpack BP.  */
  98
  99 static inline void
 100 unpack_ts_base_value_fields (struct bitpack_d *bp, tree expr)
 101 {
 102   /* Note that the code for EXPR has already been unpacked to create EXPR in
 103      streamer_alloc_tree.  */
 104   if (!TYPE_P (expr))
 105     {
 106       TREE_SIDE_EFFECTS (expr) = (unsigned) bp_unpack_value (bp, 1);
 107       TREE_CONSTANT (expr) = (unsigned) bp_unpack_value (bp, 1);
 108       TREE_READONLY (expr) = (unsigned) bp_unpack_value (bp, 1);
 109
 110       /* TREE_PUBLIC is used on types to indicate that the type
 111          has a TYPE_CACHED_VALUES vector.  This is not streamed out,
 112          so we skip it here.  */
 113       TREE_PUBLIC (expr) = (unsigned) bp_unpack_value (bp, 1);
 114     }
 115   else
 116     bp_unpack_value (bp, 4);
 117   TREE_ADDRESSABLE (expr) = (unsigned) bp_unpack_value (bp, 1);
 118   TREE_THIS_VOLATILE (expr) = (unsigned) bp_unpack_value (bp, 1);
 119   if (DECL_P (expr))
 120     {
 121       DECL_UNSIGNED (expr) = (unsigned) bp_unpack_value (bp, 1);
 122       DECL_NAMELESS (expr) = (unsigned) bp_unpack_value (bp, 1);
 123     }
 124   else if (TYPE_P (expr))
 125     TYPE_UNSIGNED (expr) = (unsigned) bp_unpack_value (bp, 1);
 126   else
 127     bp_unpack_value (bp, 1);
 128   TREE_ASM_WRITTEN (expr) = (unsigned) bp_unpack_value (bp, 1);
 129   if (TYPE_P (expr))
 130     TYPE_ARTIFICIAL (expr) = (unsigned) bp_unpack_value (bp, 1);
 131   else
 132     TREE_NO_WARNING (expr) = (unsigned) bp_unpack_value (bp, 1);
 133   TREE_NOTHROW (expr) = (unsigned) bp_unpack_value (bp, 1);
 134   TREE_STATIC (expr) = (unsigned) bp_unpack_value (bp, 1);
 135   if (TREE_CODE (expr) != TREE_BINFO)
 136     TREE_PRIVATE (expr) = (unsigned) bp_unpack_value (bp, 1);
 137   else
 138     bp_unpack_value (bp, 1);
 139   TREE_PROTECTED (expr) = (unsigned) bp_unpack_value (bp, 1);
 140   TREE_DEPRECATED (expr) = (unsigned) bp_unpack_value (bp, 1);
 141   if (TYPE_P (expr))
 142     {
 143       if (AGGREGATE_TYPE_P (expr))
 144         TYPE_REVERSE_STORAGE_ORDER (expr) = (unsigned) bp_unpack_value (bp, 1);
 145       else
 146         TYPE_SATURATING (expr) = (unsigned) bp_unpack_value (bp, 1);
 147       TYPE_ADDR_SPACE (expr) = (unsigned) bp_unpack_value (bp, 8);
 148     }
 149   else if (TREE_CODE (expr) == BIT_FIELD_REF || TREE_CODE (expr) == MEM_REF)
 150     {
 151       REF_REVERSE_STORAGE_ORDER (expr) = (unsigned) bp_unpack_value (bp, 1);
 152       bp_unpack_value (bp, 8);
 153     }
 154   else if (TREE_CODE (expr) == SSA_NAME)
 155     {
 156       SSA_NAME_IS_DEFAULT_DEF (expr) = (unsigned) bp_unpack_value (bp, 1);
 157       bp_unpack_value (bp, 8);
 158     }
 159   else
 160     bp_unpack_value (bp, 9);
 161 }
 162
 163
 164 /* Unpack all the non-pointer fields of the TS_INT_CST structure of
 165    expression EXPR from bitpack BP.  */
 166
 167 static void
 168 unpack_ts_int_cst_value_fields (struct bitpack_d *bp, tree expr)
 169 {
 170   int i;
 171   for (i = 0; i < TREE_INT_CST_EXT_NUNITS (expr); i++)
 172     TREE_INT_CST_ELT (expr, i) = bp_unpack_var_len_int (bp);
 173 }
 174
 175
 176 /* Unpack all the non-pointer fields of the TS_REAL_CST structure of
 177    expression EXPR from bitpack BP.  */
 178
 179 static void
 180 unpack_ts_real_cst_value_fields (struct bitpack_d *bp, tree expr)
 181 {
 182   unsigned i;
 183   REAL_VALUE_TYPE r;
 184   REAL_VALUE_TYPE *rp;
 185
 186   /* Clear all bits of the real value type so that we can later do
 187      bitwise comparisons to see if two values are the same.  */
 188   memset (&r, 0, sizeof r);
 189   r.cl = (unsigned) bp_unpack_value (bp, 2);
 190   r.decimal = (unsigned) bp_unpack_value (bp, 1);
 191   r.sign = (unsigned) bp_unpack_value (bp, 1);
 192   r.signalling = (unsigned) bp_unpack_value (bp, 1);
 193   r.canonical = (unsigned) bp_unpack_value (bp, 1);
 194   r.uexp = (unsigned) bp_unpack_value (bp, EXP_BITS);
 195   for (i = 0; i < SIGSZ; i++)
 196     r.sig[i] = (unsigned long) bp_unpack_value (bp, HOST_BITS_PER_LONG);
 197
 198   rp = ggc_alloc<real_value> ();
 199   memcpy (rp, &r, sizeof (REAL_VALUE_TYPE));
 200   TREE_REAL_CST_PTR (expr) = rp;
 201 }
 202
 203
 204 /* Unpack all the non-pointer fields of the TS_FIXED_CST structure of
 205    expression EXPR from bitpack BP.  */
 206
 207 static void
 208 unpack_ts_fixed_cst_value_fields (struct bitpack_d *bp, tree expr)
 209 {
 210   FIXED_VALUE_TYPE *fp = ggc_alloc<fixed_value> ();
 211   fp->mode = bp_unpack_machine_mode (bp);
 212   fp->data.low = bp_unpack_var_len_int (bp);
 213   fp->data.high = bp_unpack_var_len_int (bp);
 214   TREE_FIXED_CST_PTR (expr) = fp;
 215 }
 216
 217 /* Unpack all the non-pointer fields of the TS_DECL_COMMON structure
 218    of expression EXPR from bitpack BP.  */
 219
 220 static void
 221 unpack_ts_decl_common_value_fields (struct bitpack_d *bp, tree expr)
 222 {
 223   DECL_MODE (expr) = bp_unpack_machine_mode (bp);
 224   DECL_NONLOCAL (expr) = (unsigned) bp_unpack_value (bp, 1);
 225   DECL_VIRTUAL_P (expr) = (unsigned) bp_unpack_value (bp, 1);
 226   DECL_IGNORED_P (expr) = (unsigned) bp_unpack_value (bp, 1);
 227   DECL_ABSTRACT_P (expr) = (unsigned) bp_unpack_value (bp, 1);
 228   DECL_ARTIFICIAL (expr) = (unsigned) bp_unpack_value (bp, 1);
 229   DECL_USER_ALIGN (expr) = (unsigned) bp_unpack_value (bp, 1);
 230   DECL_PRESERVE_P (expr) = (unsigned) bp_unpack_value (bp, 1);
 231   DECL_EXTERNAL (expr) = (unsigned) bp_unpack_value (bp, 1);
 232   DECL_GIMPLE_REG_P (expr) = (unsigned) bp_unpack_value (bp, 1);
 233   SET_DECL_ALIGN (expr, (unsigned) bp_unpack_var_len_unsigned (bp));
 234 #ifdef ACCEL_COMPILER
 235   if (DECL_ALIGN (expr) > targetm.absolute_biggest_alignment)
 236     SET_DECL_ALIGN (expr, targetm.absolute_biggest_alignment);
 237 #endif
 238   if (TREE_CODE (expr) == LABEL_DECL)
 239     {
 240       EH_LANDING_PAD_NR (expr) = (int) bp_unpack_var_len_unsigned (bp);
 241
 242       /* Always assume an initial value of -1 for LABEL_DECL_UID to
 243          force gimple_set_bb to recreate label_to_block_map.  */
 244       LABEL_DECL_UID (expr) = -1;
 245     }
 246
 247   if (TREE_CODE (expr) == FIELD_DECL)
 248     {
 249       DECL_PACKED (expr) = (unsigned) bp_unpack_value (bp, 1);
 250       DECL_NONADDRESSABLE_P (expr) = (unsigned) bp_unpack_value (bp, 1);
 251       expr->decl_common.off_align = bp_unpack_value (bp, 8);
 252     }
 253
 254   if (VAR_P (expr))
 255     {
 256       DECL_HAS_DEBUG_EXPR_P (expr) = (unsigned) bp_unpack_value (bp, 1);
 257       DECL_NONLOCAL_FRAME (expr) = (unsigned) bp_unpack_value (bp, 1);
 258     }
 259
 260   if (TREE_CODE (expr) == RESULT_DECL
 261       || TREE_CODE (expr) == PARM_DECL
 262       || VAR_P (expr))
 263     {
 264       DECL_BY_REFERENCE (expr) = (unsigned) bp_unpack_value (bp, 1);
 265       if (VAR_P (expr) || TREE_CODE (expr) == PARM_DECL)
 266         DECL_HAS_VALUE_EXPR_P (expr) = (unsigned) bp_unpack_value (bp, 1);
 267     }
 268 }
 269
 270
 271 /* Unpack all the non-pointer fields of the TS_DECL_WRTL structure
 272    of expression EXPR from bitpack BP.  */
 273
 274 static void
 275 unpack_ts_decl_wrtl_value_fields (struct bitpack_d *bp, tree expr)
 276 {
 277   DECL_REGISTER (expr) = (unsigned) bp_unpack_value (bp, 1);
 278 }
 279
 280
 281 /* Unpack all the non-pointer fields of the TS_DECL_WITH_VIS structure
 282    of expression EXPR from bitpack BP.  */
 283
 284 static void
 285 unpack_ts_decl_with_vis_value_fields (struct bitpack_d *bp, tree expr)
 286 {
 287   DECL_COMMON (expr) = (unsigned) bp_unpack_value (bp, 1);
 288   DECL_DLLIMPORT_P (expr) = (unsigned) bp_unpack_value (bp, 1);
 289   DECL_WEAK (expr) = (unsigned) bp_unpack_value (bp, 1);
 290   DECL_SEEN_IN_BIND_EXPR_P (expr) = (unsigned) bp_unpack_value (bp,  1);
 291   DECL_COMDAT (expr) = (unsigned) bp_unpack_value (bp,  1);
 292   DECL_VISIBILITY (expr) = (enum symbol_visibility) bp_unpack_value (bp,  2);
 293   DECL_VISIBILITY_SPECIFIED (expr) = (unsigned) bp_unpack_value (bp,  1);
 294
 295   if (VAR_P (expr))
 296     {
 297       DECL_HARD_REGISTER (expr) = (unsigned) bp_unpack_value (bp, 1);
 298       DECL_IN_CONSTANT_POOL (expr) = (unsigned) bp_unpack_value (bp, 1);
 299     }
 300
 301   if (TREE_CODE (expr) == FUNCTION_DECL)
 302     {
 303       DECL_FINAL_P (expr) = (unsigned) bp_unpack_value (bp, 1);
 304       DECL_CXX_CONSTRUCTOR_P (expr) = (unsigned) bp_unpack_value (bp, 1);
 305       DECL_CXX_DESTRUCTOR_P (expr) = (unsigned) bp_unpack_value (bp, 1);
 306     }
 307 }
 308
 309
 310 /* Unpack all the non-pointer fields of the TS_FUNCTION_DECL structure
 311    of expression EXPR from bitpack BP.  */
 312
 313 static void
 314 unpack_ts_function_decl_value_fields (struct bitpack_d *bp, tree expr)
 315 {
 316   DECL_BUILT_IN_CLASS (expr) = bp_unpack_enum (bp, built_in_class,
 317                                                BUILT_IN_LAST);
 318   DECL_STATIC_CONSTRUCTOR (expr) = (unsigned) bp_unpack_value (bp, 1);
 319   DECL_STATIC_DESTRUCTOR (expr) = (unsigned) bp_unpack_value (bp, 1);
 320   DECL_UNINLINABLE (expr) = (unsigned) bp_unpack_value (bp, 1);
 321   DECL_POSSIBLY_INLINED (expr) = (unsigned) bp_unpack_value (bp, 1);
 322   DECL_IS_NOVOPS (expr) = (unsigned) bp_unpack_value (bp, 1);
 323   DECL_IS_RETURNS_TWICE (expr) = (unsigned) bp_unpack_value (bp, 1);
 324   DECL_IS_MALLOC (expr) = (unsigned) bp_unpack_value (bp, 1);
 325   DECL_IS_OPERATOR_NEW (expr) = (unsigned) bp_unpack_value (bp, 1);
 326   DECL_DECLARED_INLINE_P (expr) = (unsigned) bp_unpack_value (bp, 1);
 327   DECL_STATIC_CHAIN (expr) = (unsigned) bp_unpack_value (bp, 1);
 328   DECL_NO_INLINE_WARNING_P (expr) = (unsigned) bp_unpack_value (bp, 1);
 329   DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (expr)
 330                         = (unsigned) bp_unpack_value (bp, 1);
 331   DECL_NO_LIMIT_STACK (expr) = (unsigned) bp_unpack_value (bp, 1);
 332   DECL_DISREGARD_INLINE_LIMITS (expr) = (unsigned) bp_unpack_value (bp, 1);
 333   DECL_PURE_P (expr) = (unsigned) bp_unpack_value (bp, 1);
 334   DECL_LOOPING_CONST_OR_PURE_P (expr) = (unsigned) bp_unpack_value (bp, 1);
 335   if (DECL_BUILT_IN_CLASS (expr) != NOT_BUILT_IN)
 336     {
 337       DECL_FUNCTION_CODE (expr) = (enum built_in_function) bp_unpack_value (bp,
 338                                                                             12);
 339       if (DECL_BUILT_IN_CLASS (expr) == BUILT_IN_NORMAL
 340           && DECL_FUNCTION_CODE (expr) >= END_BUILTINS)
 341         fatal_error (input_location,
 342                      "machine independent builtin code out of range");
 343       else if (DECL_BUILT_IN_CLASS (expr) == BUILT_IN_MD)
 344         {
 345           tree result = targetm.builtin_decl (DECL_FUNCTION_CODE (expr), true);
 346           if (!result || result == error_mark_node)
 347             fatal_error (input_location,
 348                          "target specific builtin not available");
 349         }
 350     }
 351 }
 352
 353
 354 /* Unpack all the non-pointer fields of the TS_TYPE_COMMON structure
 355    of expression EXPR from bitpack BP.  */
 356
 357 static void
 358 unpack_ts_type_common_value_fields (struct bitpack_d *bp, tree expr)
 359 {
 360   machine_mode mode;
 361
 362   mode = bp_unpack_machine_mode (bp);
 363   SET_TYPE_MODE (expr, mode);
 364   TYPE_STRING_FLAG (expr) = (unsigned) bp_unpack_value (bp, 1);
 365   /* TYPE_NO_FORCE_BLK is private to stor-layout and need
 366      no streaming.  */
 367   TYPE_NEEDS_CONSTRUCTING (expr) = (unsigned) bp_unpack_value (bp, 1);
 368   TYPE_PACKED (expr) = (unsigned) bp_unpack_value (bp, 1);
 369   TYPE_RESTRICT (expr) = (unsigned) bp_unpack_value (bp, 1);
 370   TYPE_USER_ALIGN (expr) = (unsigned) bp_unpack_value (bp, 1);
 371   TYPE_READONLY (expr) = (unsigned) bp_unpack_value (bp, 1);
 372   if (RECORD_OR_UNION_TYPE_P (expr))
 373     {
 374       TYPE_TRANSPARENT_AGGR (expr) = (unsigned) bp_unpack_value (bp, 1);
 375       TYPE_FINAL_P (expr) = (unsigned) bp_unpack_value (bp, 1);
 376     }
 377   else if (TREE_CODE (expr) == ARRAY_TYPE)
 378     TYPE_NONALIASED_COMPONENT (expr) = (unsigned) bp_unpack_value (bp, 1);
 379   TYPE_PRECISION (expr) = bp_unpack_var_len_unsigned (bp);
 380   SET_TYPE_ALIGN (expr, bp_unpack_var_len_unsigned (bp));
 381 #ifdef ACCEL_COMPILER
 382   if (TYPE_ALIGN (expr) > targetm.absolute_biggest_alignment)
 383     SET_TYPE_ALIGN (expr, targetm.absolute_biggest_alignment);
 384 #endif
 385 }
 386
 387
 388 /* Unpack all the non-pointer fields of the TS_BLOCK structure
 389    of expression EXPR from bitpack BP.  */
 390
 391 static void
 392 unpack_ts_block_value_fields (struct data_in *data_in,
 393                               struct bitpack_d *bp, tree expr)
 394 {
 395   BLOCK_ABSTRACT (expr) = (unsigned) bp_unpack_value (bp, 1);
 396   /* BLOCK_NUMBER is recomputed.  */
 397   stream_input_location (&BLOCK_SOURCE_LOCATION (expr), bp, data_in);
 398 }
 399
 400 /* Unpack all the non-pointer fields of the TS_TRANSLATION_UNIT_DECL
 401    structure of expression EXPR from bitpack BP.  */
 402
 403 static void
 404 unpack_ts_translation_unit_decl_value_fields (struct data_in *data_in,
 405                                               struct bitpack_d *bp, tree expr)
 406 {
 407   TRANSLATION_UNIT_LANGUAGE (expr) = xstrdup (bp_unpack_string (data_in, bp));
 408   vec_safe_push (all_translation_units, expr);
 409 }
 410
 411
 412 /* Unpack all the non-pointer fields of the TS_OMP_CLAUSE
 413    structure of expression EXPR from bitpack BP.  */
 414
 415 static void
 416 unpack_ts_omp_clause_value_fields (struct data_in *data_in,
 417                                    struct bitpack_d *bp, tree expr)
 418 {
 419   stream_input_location (&OMP_CLAUSE_LOCATION (expr), bp, data_in);
 420   switch (OMP_CLAUSE_CODE (expr))
 421     {
 422     case OMP_CLAUSE_DEFAULT:
 423       OMP_CLAUSE_DEFAULT_KIND (expr)
 424         = bp_unpack_enum (bp, omp_clause_default_kind,
 425                           OMP_CLAUSE_DEFAULT_LAST);
 426       break;
 427     case OMP_CLAUSE_SCHEDULE:
 428       OMP_CLAUSE_SCHEDULE_KIND (expr)
 429         = bp_unpack_enum (bp, omp_clause_schedule_kind,
 430                           OMP_CLAUSE_SCHEDULE_LAST);
 431       break;
 432     case OMP_CLAUSE_DEPEND:
 433       OMP_CLAUSE_DEPEND_KIND (expr)
 434         = bp_unpack_enum (bp, omp_clause_depend_kind, OMP_CLAUSE_DEPEND_LAST);
 435       break;
 436     case OMP_CLAUSE_MAP:
 437       OMP_CLAUSE_SET_MAP_KIND (expr, bp_unpack_enum (bp, gomp_map_kind,
 438                                                      GOMP_MAP_LAST));
 439       break;
 440     case OMP_CLAUSE_PROC_BIND:
 441       OMP_CLAUSE_PROC_BIND_KIND (expr)
 442         = bp_unpack_enum (bp, omp_clause_proc_bind_kind,
 443                           OMP_CLAUSE_PROC_BIND_LAST);
 444       break;
 445     case OMP_CLAUSE_REDUCTION:
 446       OMP_CLAUSE_REDUCTION_CODE (expr)
 447         = bp_unpack_enum (bp, tree_code, MAX_TREE_CODES);
 448       break;
 449     default:
 450       break;
 451     }
 452 }
 453
 454
 455 /* Read all the language-independent bitfield values for EXPR from IB.
 456    Return the partially unpacked bitpack so the caller can unpack any other
 457    bitfield values that the writer may have written.  */
 458
 459 void
 460 streamer_read_tree_bitfields (struct lto_input_block *ib,
 461                               struct data_in *data_in, tree expr)
 462 {
 463   enum tree_code code;
 464   struct bitpack_d bp;
 465
 466   /* Read the bitpack of non-pointer values from IB.  */
 467   bp = streamer_read_bitpack (ib);
 468
 469   /* The first word in BP contains the code of the tree that we
 470      are about to read.  */
 471   code = (enum tree_code) bp_unpack_value (&bp, 16);
 472   lto_tag_check (lto_tree_code_to_tag (code),
 473                  lto_tree_code_to_tag (TREE_CODE (expr)));
 474
 475   /* Note that all these functions are highly sensitive to changes in
 476      the types and sizes of each of the fields being packed.  */
 477   unpack_ts_base_value_fields (&bp, expr);
 478
 479   if (CODE_CONTAINS_STRUCT (code, TS_INT_CST))
 480     unpack_ts_int_cst_value_fields (&bp, expr);
 481
 482   if (CODE_CONTAINS_STRUCT (code, TS_REAL_CST))
 483     unpack_ts_real_cst_value_fields (&bp, expr);
 484
 485   if (CODE_CONTAINS_STRUCT (code, TS_FIXED_CST))
 486     unpack_ts_fixed_cst_value_fields (&bp, expr);
 487
 488   if (CODE_CONTAINS_STRUCT (code, TS_DECL_MINIMAL))
 489     stream_input_location (&DECL_SOURCE_LOCATION (expr), &bp, data_in);
 490
 491   if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
 492     unpack_ts_decl_common_value_fields (&bp, expr);
 493
 494   if (CODE_CONTAINS_STRUCT (code, TS_DECL_WRTL))
 495     unpack_ts_decl_wrtl_value_fields (&bp, expr);
 496
 497   if (CODE_CONTAINS_STRUCT (code, TS_DECL_WITH_VIS))
 498     unpack_ts_decl_with_vis_value_fields (&bp, expr);
 499
 500   if (CODE_CONTAINS_STRUCT (code, TS_FUNCTION_DECL))
 501     unpack_ts_function_decl_value_fields (&bp, expr);
 502
 503   if (CODE_CONTAINS_STRUCT (code, TS_TYPE_COMMON))
 504     unpack_ts_type_common_value_fields (&bp, expr);
 505
 506   if (CODE_CONTAINS_STRUCT (code, TS_EXP))
 507     {
 508       stream_input_location (&EXPR_CHECK (expr)->exp.locus, &bp, data_in);
 509       if (code == MEM_REF
 510           || code == TARGET_MEM_REF)
 511         {
 512           MR_DEPENDENCE_CLIQUE (expr)
 513             = (unsigned)bp_unpack_value (&bp, sizeof (short) * 8);
 514           if (MR_DEPENDENCE_CLIQUE (expr) != 0)
 515             MR_DEPENDENCE_BASE (expr)
 516               = (unsigned)bp_unpack_value (&bp, sizeof (short) * 8);
 517         }
 518     }
 519
 520   if (CODE_CONTAINS_STRUCT (code, TS_BLOCK))
 521     unpack_ts_block_value_fields (data_in, &bp, expr);
 522
 523   if (CODE_CONTAINS_STRUCT (code, TS_TRANSLATION_UNIT_DECL))
 524     unpack_ts_translation_unit_decl_value_fields (data_in, &bp, expr);
 525
 526   if (CODE_CONTAINS_STRUCT (code, TS_OPTIMIZATION))
 527     cl_optimization_stream_in (&bp, TREE_OPTIMIZATION (expr));
 528
 529   if (CODE_CONTAINS_STRUCT (code, TS_BINFO))
 530     {
 531       unsigned HOST_WIDE_INT length = bp_unpack_var_len_unsigned (&bp);
 532       if (length > 0)
 533         vec_safe_grow (BINFO_BASE_ACCESSES (expr), length);
 534     }
 535
 536   if (CODE_CONTAINS_STRUCT (code, TS_CONSTRUCTOR))
 537     {
 538       unsigned HOST_WIDE_INT length = bp_unpack_var_len_unsigned (&bp);
 539       if (length > 0)
 540         vec_safe_grow (CONSTRUCTOR_ELTS (expr), length);
 541     }
 542
 543 #ifndef ACCEL_COMPILER
 544   if (CODE_CONTAINS_STRUCT (code, TS_TARGET_OPTION))
 545     {
 546       cl_target_option_stream_in (data_in, &bp, TREE_TARGET_OPTION (expr));
 547       if (targetm.target_option.post_stream_in)
 548         targetm.target_option.post_stream_in (TREE_TARGET_OPTION (expr));
 549     }
 550 #endif
 551
 552   if (code == OMP_CLAUSE)
 553     unpack_ts_omp_clause_value_fields (data_in, &bp, expr);
 554 }
 555
 556
 557 /* Materialize a new tree from input block IB using descriptors in
 558    DATA_IN.  The code for the new tree should match TAG.  Store in
 559    *IX_P the index into the reader cache where the new tree is stored.  */
 560
 561 tree
 562 streamer_alloc_tree (struct lto_input_block *ib, struct data_in *data_in,
 563                      enum LTO_tags tag)
 564 {
 565   enum tree_code code;
 566   tree result;
 567 #ifdef LTO_STREAMER_DEBUG
 568   HOST_WIDE_INT orig_address_in_writer;
 569 #endif
 570
 571   result = NULL_TREE;
 572
 573 #ifdef LTO_STREAMER_DEBUG
 574   /* Read the word representing the memory address for the tree
 575      as it was written by the writer.  This is useful when
 576      debugging differences between the writer and reader.  */
 577   orig_address_in_writer = streamer_read_hwi (ib);
 578   gcc_assert ((intptr_t) orig_address_in_writer == orig_address_in_writer);
 579 #endif
 580
 581   code = lto_tag_to_tree_code (tag);
 582
 583   /* We should never see an SSA_NAME tree.  Only the version numbers of
 584      SSA names are ever written out.  See input_ssa_names.  */
 585   gcc_assert (code != SSA_NAME);
 586
 587   /* Instantiate a new tree using the header data.  */
 588   if (CODE_CONTAINS_STRUCT (code, TS_STRING))
 589     result = streamer_read_string_cst (data_in, ib);
 590   else if (CODE_CONTAINS_STRUCT (code, TS_IDENTIFIER))
 591     result = input_identifier (data_in, ib);
 592   else if (CODE_CONTAINS_STRUCT (code, TS_VEC))
 593     {
 594       HOST_WIDE_INT len = streamer_read_hwi (ib);
 595       result = make_tree_vec (len);
 596     }
 597   else if (CODE_CONTAINS_STRUCT (code, TS_VECTOR))
 598     {
 599       HOST_WIDE_INT len = streamer_read_hwi (ib);
 600       result = make_vector (len);
 601     }
 602   else if (CODE_CONTAINS_STRUCT (code, TS_BINFO))
 603     {
 604       unsigned HOST_WIDE_INT len = streamer_read_uhwi (ib);
 605       result = make_tree_binfo (len);
 606     }
 607   else if (CODE_CONTAINS_STRUCT (code, TS_INT_CST))
 608     {
 609       unsigned HOST_WIDE_INT len = streamer_read_uhwi (ib);
 610       unsigned HOST_WIDE_INT ext_len = streamer_read_uhwi (ib);
 611       result = make_int_cst (len, ext_len);
 612     }
 613   else if (code == CALL_EXPR)
 614     {
 615       unsigned HOST_WIDE_INT nargs = streamer_read_uhwi (ib);
 616       return build_vl_exp (CALL_EXPR, nargs + 3);
 617     }
 618   else if (code == OMP_CLAUSE)
 619     {
 620       enum omp_clause_code subcode
 621         = (enum omp_clause_code) streamer_read_uhwi (ib);
 622       return build_omp_clause (UNKNOWN_LOCATION, subcode);
 623     }
 624   else
 625     {
 626       /* For all other nodes, materialize the tree with a raw
 627          make_node call.  */
 628       result = make_node (code);
 629     }
 630
 631 #ifdef LTO_STREAMER_DEBUG
 632   /* Store the original address of the tree as seen by the writer
 633      in RESULT's aux field.  This is useful when debugging streaming
 634      problems.  This way, a debugging session can be started on
 635      both writer and reader with a breakpoint using this address
 636      value in both.  */
 637   lto_orig_address_map (result, (intptr_t) orig_address_in_writer);
 638 #endif
 639
 640   return result;
 641 }
 642
 643
 644 /* Read all pointer fields in the TS_COMMON structure of EXPR from input
 645    block IB.  DATA_IN contains tables and descriptors for the
 646    file being read.  */
 647
 648
 649 static void
 650 lto_input_ts_common_tree_pointers (struct lto_input_block *ib,
 651                                    struct data_in *data_in, tree expr)
 652 {
 653   if (TREE_CODE (expr) != IDENTIFIER_NODE)
 654     TREE_TYPE (expr) = stream_read_tree (ib, data_in);
 655 }
 656
 657
 658 /* Read all pointer fields in the TS_VECTOR structure of EXPR from input
 659    block IB.  DATA_IN contains tables and descriptors for the
 660    file being read.  */
 661
 662 static void
 663 lto_input_ts_vector_tree_pointers (struct lto_input_block *ib,
 664                                    struct data_in *data_in, tree expr)
 665 {
 666   unsigned i;
 667   for (i = 0; i < VECTOR_CST_NELTS (expr); ++i)
 668     VECTOR_CST_ELT (expr, i) = stream_read_tree (ib, data_in);
 669 }
 670
 671
 672 /* Read all pointer fields in the TS_COMPLEX structure of EXPR from input
 673    block IB.  DATA_IN contains tables and descriptors for the
 674    file being read.  */
 675
 676 static void
 677 lto_input_ts_complex_tree_pointers (struct lto_input_block *ib,
 678                                     struct data_in *data_in, tree expr)
 679 {
 680   TREE_REALPART (expr) = stream_read_tree (ib, data_in);
 681   TREE_IMAGPART (expr) = stream_read_tree (ib, data_in);
 682 }
 683
 684
 685 /* Read all pointer fields in the TS_DECL_MINIMAL structure of EXPR
 686    from input block IB.  DATA_IN contains tables and descriptors for the
 687    file being read.  */
 688
 689 static void
 690 lto_input_ts_decl_minimal_tree_pointers (struct lto_input_block *ib,
 691                                          struct data_in *data_in, tree expr)
 692 {
 693   DECL_NAME (expr) = stream_read_tree (ib, data_in);
 694   DECL_CONTEXT (expr) = stream_read_tree (ib, data_in);
 695 }
 696
 697
 698 /* Read all pointer fields in the TS_DECL_COMMON structure of EXPR from
 699    input block IB.  DATA_IN contains tables and descriptors for the
 700    file being read.  */
 701
 702 static void
 703 lto_input_ts_decl_common_tree_pointers (struct lto_input_block *ib,
 704                                         struct data_in *data_in, tree expr)
 705 {
 706   DECL_SIZE (expr) = stream_read_tree (ib, data_in);
 707   DECL_SIZE_UNIT (expr) = stream_read_tree (ib, data_in);
 708   DECL_ATTRIBUTES (expr) = stream_read_tree (ib, data_in);
 709
 710   /* Do not stream DECL_ABSTRACT_ORIGIN.  We cannot handle debug information
 711      for early inlining so drop it on the floor instead of ICEing in
 712      dwarf2out.c.  */
 713
 714   if ((VAR_P (expr) || TREE_CODE (expr) == PARM_DECL)
 715       && DECL_HAS_VALUE_EXPR_P (expr))
 716     SET_DECL_VALUE_EXPR (expr, stream_read_tree (ib, data_in));
 717
 718   if (VAR_P (expr))
 719     {
 720       tree dexpr = stream_read_tree (ib, data_in);
 721       if (dexpr)
 722         SET_DECL_DEBUG_EXPR (expr, dexpr);
 723     }
 724 }
 725
 726
 727 /* Read all pointer fields in the TS_DECL_NON_COMMON structure of
 728    EXPR from input block IB.  DATA_IN contains tables and descriptors for the
 729    file being read.  */
 730
 731 static void
 732 lto_input_ts_decl_non_common_tree_pointers (struct lto_input_block *ib,
 733                                             struct data_in *data_in, tree expr)
 734 {
 735   if (TREE_CODE (expr) == TYPE_DECL)
 736     DECL_ORIGINAL_TYPE (expr) = stream_read_tree (ib, data_in);
 737 }
 738
 739
 740 /* Read all pointer fields in the TS_DECL_WITH_VIS structure of EXPR
 741    from input block IB.  DATA_IN contains tables and descriptors for the
 742    file being read.  */
 743
 744 static void
 745 lto_input_ts_decl_with_vis_tree_pointers (struct lto_input_block *ib,
 746                                           struct data_in *data_in, tree expr)
 747 {
 748   tree id;
 749
 750   id = stream_read_tree (ib, data_in);
 751   if (id)
 752     {
 753       gcc_assert (TREE_CODE (id) == IDENTIFIER_NODE);
 754       SET_DECL_ASSEMBLER_NAME (expr, id);
 755     }
 756 }
 757
 758
 759 /* Read all pointer fields in the TS_FIELD_DECL structure of EXPR from
 760    input block IB.  DATA_IN contains tables and descriptors for the
 761    file being read.  */
 762
 763 static void
 764 lto_input_ts_field_decl_tree_pointers (struct lto_input_block *ib,
 765                                        struct data_in *data_in, tree expr)
 766 {
 767   DECL_FIELD_OFFSET (expr) = stream_read_tree (ib, data_in);
 768   DECL_BIT_FIELD_TYPE (expr) = stream_read_tree (ib, data_in);
 769   DECL_BIT_FIELD_REPRESENTATIVE (expr) = stream_read_tree (ib, data_in);
 770   DECL_FIELD_BIT_OFFSET (expr) = stream_read_tree (ib, data_in);
 771   DECL_FCONTEXT (expr) = stream_read_tree (ib, data_in);
 772 }
 773
 774
 775 /* Read all pointer fields in the TS_FUNCTION_DECL structure of EXPR
 776    from input block IB.  DATA_IN contains tables and descriptors for the
 777    file being read.  */
 778
 779 static void
 780 lto_input_ts_function_decl_tree_pointers (struct lto_input_block *ib,
 781                                           struct data_in *data_in, tree expr)
 782 {
 783   DECL_VINDEX (expr) = stream_read_tree (ib, data_in);
 784   /* DECL_STRUCT_FUNCTION is loaded on demand by cgraph_get_body.  */
 785   DECL_FUNCTION_PERSONALITY (expr) = stream_read_tree (ib, data_in);
 786 #ifndef ACCEL_COMPILER
 787   DECL_FUNCTION_SPECIFIC_TARGET (expr) = stream_read_tree (ib, data_in);
 788 #endif
 789   DECL_FUNCTION_SPECIFIC_OPTIMIZATION (expr) = stream_read_tree (ib, data_in);
 790
 791   /* If the file contains a function with an EH personality set,
 792      then it was compiled with -fexceptions.  In that case, initialize
 793      the backend EH machinery.  */
 794   if (DECL_FUNCTION_PERSONALITY (expr))
 795     lto_init_eh ();
 796 }
 797
 798
 799 /* Read all pointer fields in the TS_TYPE_COMMON structure of EXPR from
 800    input block IB.  DATA_IN contains tables and descriptors for the file
 801    being read.  */
 802
 803 static void
 804 lto_input_ts_type_common_tree_pointers (struct lto_input_block *ib,
 805                                         struct data_in *data_in, tree expr)
 806 {
 807   TYPE_SIZE (expr) = stream_read_tree (ib, data_in);
 808   TYPE_SIZE_UNIT (expr) = stream_read_tree (ib, data_in);
 809   TYPE_ATTRIBUTES (expr) = stream_read_tree (ib, data_in);
 810   TYPE_NAME (expr) = stream_read_tree (ib, data_in);
 811   /* Do not stream TYPE_POINTER_TO or TYPE_REFERENCE_TO.  They will be
 812      reconstructed during fixup.  */
 813   /* Do not stream TYPE_NEXT_VARIANT, we reconstruct the variant lists
 814      during fixup.  */
 815   TYPE_MAIN_VARIANT (expr) = stream_read_tree (ib, data_in);
 816   TYPE_CONTEXT (expr) = stream_read_tree (ib, data_in);
 817   /* TYPE_CANONICAL gets re-computed during type merging.  */
 818   TYPE_CANONICAL (expr) = NULL_TREE;
 819   TYPE_STUB_DECL (expr) = stream_read_tree (ib, data_in);
 820 }
 821
 822 /* Read all pointer fields in the TS_TYPE_NON_COMMON structure of EXPR
 823    from input block IB.  DATA_IN contains tables and descriptors for the
 824    file being read.  */
 825
 826 static void
 827 lto_input_ts_type_non_common_tree_pointers (struct lto_input_block *ib,
 828                                             struct data_in *data_in,
 829                                             tree expr)
 830 {
 831   if (TREE_CODE (expr) == ENUMERAL_TYPE)
 832     TYPE_VALUES (expr) = stream_read_tree (ib, data_in);
 833   else if (TREE_CODE (expr) == ARRAY_TYPE)
 834     TYPE_DOMAIN (expr) = stream_read_tree (ib, data_in);
 835   else if (RECORD_OR_UNION_TYPE_P (expr))
 836     TYPE_FIELDS (expr) = streamer_read_chain (ib, data_in);
 837   else if (TREE_CODE (expr) == FUNCTION_TYPE
 838            || TREE_CODE (expr) == METHOD_TYPE)
 839     TYPE_ARG_TYPES (expr) = stream_read_tree (ib, data_in);
 840
 841   if (!POINTER_TYPE_P (expr))
 842     TYPE_MINVAL (expr) = stream_read_tree (ib, data_in);
 843   TYPE_MAXVAL (expr) = stream_read_tree (ib, data_in);
 844   if (RECORD_OR_UNION_TYPE_P (expr))
 845     TYPE_BINFO (expr) = stream_read_tree (ib, data_in);
 846 }
 847
 848
 849 /* Read all pointer fields in the TS_LIST structure of EXPR from input
 850    block IB.  DATA_IN contains tables and descriptors for the
 851    file being read.  */
 852
 853 static void
 854 lto_input_ts_list_tree_pointers (struct lto_input_block *ib,
 855                                  struct data_in *data_in, tree expr)
 856 {
 857   TREE_PURPOSE (expr) = stream_read_tree (ib, data_in);
 858   TREE_VALUE (expr) = stream_read_tree (ib, data_in);
 859   TREE_CHAIN (expr) = stream_read_tree (ib, data_in);
 860 }
 861
 862
 863 /* Read all pointer fields in the TS_VEC structure of EXPR from input
 864    block IB.  DATA_IN contains tables and descriptors for the
 865    file being read.  */
 866
 867 static void
 868 lto_input_ts_vec_tree_pointers (struct lto_input_block *ib,
 869                                 struct data_in *data_in, tree expr)
 870 {
 871   int i;
 872
 873   /* Note that TREE_VEC_LENGTH was read by streamer_alloc_tree to
 874      instantiate EXPR.  */
 875   for (i = 0; i < TREE_VEC_LENGTH (expr); i++)
 876     TREE_VEC_ELT (expr, i) = stream_read_tree (ib, data_in);
 877 }
 878
 879
 880 /* Read all pointer fields in the TS_EXP structure of EXPR from input
 881    block IB.  DATA_IN contains tables and descriptors for the
 882    file being read.  */
 883
 884
 885 static void
 886 lto_input_ts_exp_tree_pointers (struct lto_input_block *ib,
 887                                 struct data_in *data_in, tree expr)
 888 {
 889   int i;
 890   tree block;
 891
 892   for (i = 0; i < TREE_OPERAND_LENGTH (expr); i++)
 893     TREE_OPERAND (expr, i) = stream_read_tree (ib, data_in);
 894
 895   block = stream_read_tree (ib, data_in);
 896
 897   /* TODO: Block is stored in the locus information.  It may make more sense to
 898      to make it go via the location cache.  */
 899   if (block)
 900     {
 901       data_in->location_cache.apply_location_cache ();
 902       TREE_SET_BLOCK (expr, block);
 903     }
 904 }
 905
 906
 907 /* Read all pointer fields in the TS_BLOCK structure of EXPR from input
 908    block IB.  DATA_IN contains tables and descriptors for the
 909    file being read.  */
 910
 911 static void
 912 lto_input_ts_block_tree_pointers (struct lto_input_block *ib,
 913                                   struct data_in *data_in, tree expr)
 914 {
 915   BLOCK_VARS (expr) = streamer_read_chain (ib, data_in);
 916
 917   BLOCK_SUPERCONTEXT (expr) = stream_read_tree (ib, data_in);
 918
 919   /* Stream BLOCK_ABSTRACT_ORIGIN and BLOCK_SOURCE_LOCATION for
 920      the limited cases we can handle - those that represent inlined
 921      function scopes.  For the rest them on the floor instead of ICEing in
 922      dwarf2out.c.  */
 923   BLOCK_ABSTRACT_ORIGIN (expr) = stream_read_tree (ib, data_in);
 924   /* Do not stream BLOCK_NONLOCALIZED_VARS.  We cannot handle debug information
 925      for early inlined BLOCKs so drop it on the floor instead of ICEing in
 926      dwarf2out.c.  */
 927
 928   /* BLOCK_FRAGMENT_ORIGIN and BLOCK_FRAGMENT_CHAIN is not live at LTO
 929      streaming time.  */
 930
 931   /* We re-compute BLOCK_SUBBLOCKS of our parent here instead
 932      of streaming it.  For non-BLOCK BLOCK_SUPERCONTEXTs we still
 933      stream the child relationship explicitly.  */
 934   if (BLOCK_SUPERCONTEXT (expr)
 935       && TREE_CODE (BLOCK_SUPERCONTEXT (expr)) == BLOCK)
 936     {
 937       BLOCK_CHAIN (expr) = BLOCK_SUBBLOCKS (BLOCK_SUPERCONTEXT (expr));
 938       BLOCK_SUBBLOCKS (BLOCK_SUPERCONTEXT (expr)) = expr;
 939     }
 940
 941   /* The global block is rooted at the TU decl.  Hook it here to
 942      avoid the need to stream in this block during WPA time.  */
 943   else if (BLOCK_SUPERCONTEXT (expr)
 944            && TREE_CODE (BLOCK_SUPERCONTEXT (expr)) == TRANSLATION_UNIT_DECL)
 945     DECL_INITIAL (BLOCK_SUPERCONTEXT (expr)) = expr;
 946
 947   /* The function-level block is connected at the time we read in
 948      function bodies for the same reason.  */
 949 }
 950
 951
 952 /* Read all pointer fields in the TS_BINFO structure of EXPR from input
 953    block IB.  DATA_IN contains tables and descriptors for the
 954    file being read.  */
 955
 956 static void
 957 lto_input_ts_binfo_tree_pointers (struct lto_input_block *ib,
 958                                   struct data_in *data_in, tree expr)
 959 {
 960   unsigned i;
 961   tree t;
 962
 963   /* Note that the number of slots in EXPR was read in
 964      streamer_alloc_tree when instantiating EXPR.  However, the
 965      vector is empty so we cannot rely on vec::length to know how many
 966      elements to read.  So, this list is emitted as a 0-terminated
 967      list on the writer side.  */
 968   do
 969     {
 970       t = stream_read_tree (ib, data_in);
 971       if (t)
 972         BINFO_BASE_BINFOS (expr)->quick_push (t);
 973     }
 974   while (t);
 975
 976   BINFO_OFFSET (expr) = stream_read_tree (ib, data_in);
 977   BINFO_VTABLE (expr) = stream_read_tree (ib, data_in);
 978   BINFO_VPTR_FIELD (expr) = stream_read_tree (ib, data_in);
 979
 980   /* The vector of BINFO_BASE_ACCESSES is pre-allocated during
 981      unpacking the bitfield section.  */
 982   for (i = 0; i < vec_safe_length (BINFO_BASE_ACCESSES (expr)); i++)
 983     {
 984       tree a = stream_read_tree (ib, data_in);
 985       (*BINFO_BASE_ACCESSES (expr))[i] = a;
 986     }
 987   /* Do not walk BINFO_INHERITANCE_CHAIN, BINFO_SUBVTT_INDEX
 988      and BINFO_VPTR_INDEX; these are used by C++ FE only.  */
 989 }
 990
 991
 992 /* Read all pointer fields in the TS_CONSTRUCTOR structure of EXPR from
 993    input block IB.  DATA_IN contains tables and descriptors for the
 994    file being read.  */
 995
 996 static void
 997 lto_input_ts_constructor_tree_pointers (struct lto_input_block *ib,
 998                                         struct data_in *data_in, tree expr)
 999 {
1000   unsigned i;
1001
1002   for (i = 0; i < CONSTRUCTOR_NELTS (expr); i++)
1003     {
1004       constructor_elt e;
1005       e.index = stream_read_tree (ib, data_in);
1006       e.value = stream_read_tree (ib, data_in);
1007       (*CONSTRUCTOR_ELTS (expr))[i] = e;
1008     }
1009 }
1010
1011
1012 /* Read all pointer fields in the TS_OMP_CLAUSE structure of EXPR from
1013    input block IB.  DATA_IN contains tables and descriptors for the
1014    file being read.  */
1015
1016 static void
1017 lto_input_ts_omp_clause_tree_pointers (struct lto_input_block *ib,
1018                                        struct data_in *data_in, tree expr)
1019 {
1020   int i;
1021
1022   for (i = 0; i < omp_clause_num_ops[OMP_CLAUSE_CODE (expr)]; i++)
1023     OMP_CLAUSE_OPERAND (expr, i) = stream_read_tree (ib, data_in);
1024   OMP_CLAUSE_CHAIN (expr) = stream_read_tree (ib, data_in);
1025 }
1026
1027
1028 /* Read all pointer fields in EXPR from input block IB.  DATA_IN
1029    contains tables and descriptors for the file being read.  */
1030
1031 void
1032 streamer_read_tree_body (struct lto_input_block *ib, struct data_in *data_in,
1033                          tree expr)
1034 {
1035   enum tree_code code;
1036
1037   code = TREE_CODE (expr);
1038
1039   if (CODE_CONTAINS_STRUCT (code, TS_TYPED))
1040     lto_input_ts_common_tree_pointers (ib, data_in, expr);
1041
1042   if (CODE_CONTAINS_STRUCT (code, TS_VECTOR))
1043     lto_input_ts_vector_tree_pointers (ib, data_in, expr);
1044
1045   if (CODE_CONTAINS_STRUCT (code, TS_COMPLEX))
1046     lto_input_ts_complex_tree_pointers (ib, data_in, expr);
1047
1048   if (CODE_CONTAINS_STRUCT (code, TS_DECL_MINIMAL))
1049     lto_input_ts_decl_minimal_tree_pointers (ib, data_in, expr);
1050
1051   if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
1052     lto_input_ts_decl_common_tree_pointers (ib, data_in, expr);
1053
1054   if (CODE_CONTAINS_STRUCT (code, TS_DECL_NON_COMMON))
1055     lto_input_ts_decl_non_common_tree_pointers (ib, data_in, expr);
1056
1057   if (CODE_CONTAINS_STRUCT (code, TS_DECL_WITH_VIS))
1058     lto_input_ts_decl_with_vis_tree_pointers (ib, data_in, expr);
1059
1060   if (CODE_CONTAINS_STRUCT (code, TS_FIELD_DECL))
1061     lto_input_ts_field_decl_tree_pointers (ib, data_in, expr);
1062
1063   if (CODE_CONTAINS_STRUCT (code, TS_FUNCTION_DECL))
1064     lto_input_ts_function_decl_tree_pointers (ib, data_in, expr);
1065
1066   if (CODE_CONTAINS_STRUCT (code, TS_TYPE_COMMON))
1067     lto_input_ts_type_common_tree_pointers (ib, data_in, expr);
1068
1069   if (CODE_CONTAINS_STRUCT (code, TS_TYPE_NON_COMMON))
1070     lto_input_ts_type_non_common_tree_pointers (ib, data_in, expr);
1071
1072   if (CODE_CONTAINS_STRUCT (code, TS_LIST))
1073     lto_input_ts_list_tree_pointers (ib, data_in, expr);
1074
1075   if (CODE_CONTAINS_STRUCT (code, TS_VEC))
1076     lto_input_ts_vec_tree_pointers (ib, data_in, expr);
1077
1078   if (CODE_CONTAINS_STRUCT (code, TS_EXP))
1079     lto_input_ts_exp_tree_pointers (ib, data_in, expr);
1080
1081   if (CODE_CONTAINS_STRUCT (code, TS_BLOCK))
1082     lto_input_ts_block_tree_pointers (ib, data_in, expr);
1083
1084   if (CODE_CONTAINS_STRUCT (code, TS_BINFO))
1085     lto_input_ts_binfo_tree_pointers (ib, data_in, expr);
1086
1087   if (CODE_CONTAINS_STRUCT (code, TS_CONSTRUCTOR))
1088     lto_input_ts_constructor_tree_pointers (ib, data_in, expr);
1089
1090   if (code == OMP_CLAUSE)
1091     lto_input_ts_omp_clause_tree_pointers (ib, data_in, expr);
1092 }
1093
1094
1095 /* Read an index IX from input block IB and return the tree node at
1096    DATA_IN->FILE_DATA->GLOBALS_INDEX[IX].  */
1097
1098 tree
1099 streamer_get_pickled_tree (struct lto_input_block *ib, struct data_in *data_in)
1100 {
1101   unsigned HOST_WIDE_INT ix;
1102   tree result;
1103   enum LTO_tags expected_tag;
1104
1105   ix = streamer_read_uhwi (ib);
1106   expected_tag = streamer_read_enum (ib, LTO_tags, LTO_NUM_TAGS);
1107
1108   result = streamer_tree_cache_get_tree (data_in->reader_cache, ix);
1109   gcc_assert (result
1110               && TREE_CODE (result) == lto_tag_to_tree_code (expected_tag));
1111
1112   return result;
1113 }