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