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