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