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