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