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