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