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