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