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