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