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

source code of gcc/tree-streamer-in.cc