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