coretypes.h: Include machmode.h...
[gcc.git] / gcc / tree-streamer-in.c
1 /* Routines for reading trees from a file stream.
2
3 Copyright (C) 2011-2015 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 "diagnostic.h"
26 #include "hash-set.h"
27 #include "vec.h"
28 #include "input.h"
29 #include "alias.h"
30 #include "symtab.h"
31 #include "options.h"
32 #include "inchash.h"
33 #include "tree.h"
34 #include "fold-const.h"
35 #include "stringpool.h"
36 #include "predict.h"
37 #include "tm.h"
38 #include "hard-reg-set.h"
39 #include "input.h"
40 #include "function.h"
41 #include "basic-block.h"
42 #include "tree-ssa-alias.h"
43 #include "internal-fn.h"
44 #include "gimple-expr.h"
45 #include "is-a.h"
46 #include "gimple.h"
47 #include "hash-map.h"
48 #include "plugin-api.h"
49 #include "ipa-ref.h"
50 #include "cgraph.h"
51 #include "tree-streamer.h"
52 #include "data-streamer.h"
53 #include "streamer-hooks.h"
54 #include "lto-streamer.h"
55 #include "builtins.h"
56 #include "ipa-chkp.h"
57 #include "gomp-constants.h"
58
59
60 /* Read a STRING_CST from the string table in DATA_IN using input
61 block IB. */
62
63 tree
64 streamer_read_string_cst (struct data_in *data_in, struct lto_input_block *ib)
65 {
66 unsigned int len;
67 const char * ptr;
68
69 ptr = streamer_read_indexed_string (data_in, ib, &len);
70 if (!ptr)
71 return NULL;
72 return build_string (len, ptr);
73 }
74
75
76 /* Read an IDENTIFIER from the string table in DATA_IN using input
77 block IB. */
78
79 static tree
80 input_identifier (struct data_in *data_in, struct lto_input_block *ib)
81 {
82 unsigned int len;
83 const char *ptr;
84
85 ptr = streamer_read_indexed_string (data_in, ib, &len);
86 if (!ptr)
87 return NULL;
88 return get_identifier_with_length (ptr, len);
89 }
90
91
92 /* Read a chain of tree nodes from input block IB. DATA_IN contains
93 tables and descriptors for the file being read. */
94
95 tree
96 streamer_read_chain (struct lto_input_block *ib, struct data_in *data_in)
97 {
98 tree first, prev, curr;
99
100 /* The chain is written as NULL terminated list of trees. */
101 first = prev = NULL_TREE;
102 do
103 {
104 curr = stream_read_tree (ib, data_in);
105 if (prev)
106 TREE_CHAIN (prev) = curr;
107 else
108 first = curr;
109
110 prev = curr;
111 }
112 while (curr);
113
114 return first;
115 }
116
117
118 /* Unpack all the non-pointer fields of the TS_BASE structure of
119 expression EXPR from bitpack BP. */
120
121 static inline void
122 unpack_ts_base_value_fields (struct bitpack_d *bp, tree expr)
123 {
124 /* Note that the code for EXPR has already been unpacked to create EXPR in
125 streamer_alloc_tree. */
126 if (!TYPE_P (expr))
127 {
128 TREE_SIDE_EFFECTS (expr) = (unsigned) bp_unpack_value (bp, 1);
129 TREE_CONSTANT (expr) = (unsigned) bp_unpack_value (bp, 1);
130 TREE_READONLY (expr) = (unsigned) bp_unpack_value (bp, 1);
131
132 /* TREE_PUBLIC is used on types to indicate that the type
133 has a TYPE_CACHED_VALUES vector. This is not streamed out,
134 so we skip it here. */
135 TREE_PUBLIC (expr) = (unsigned) bp_unpack_value (bp, 1);
136 }
137 else
138 bp_unpack_value (bp, 4);
139 TREE_ADDRESSABLE (expr) = (unsigned) bp_unpack_value (bp, 1);
140 TREE_THIS_VOLATILE (expr) = (unsigned) bp_unpack_value (bp, 1);
141 if (DECL_P (expr))
142 DECL_UNSIGNED (expr) = (unsigned) bp_unpack_value (bp, 1);
143 else if (TYPE_P (expr))
144 TYPE_UNSIGNED (expr) = (unsigned) bp_unpack_value (bp, 1);
145 else
146 bp_unpack_value (bp, 1);
147 TREE_ASM_WRITTEN (expr) = (unsigned) bp_unpack_value (bp, 1);
148 if (TYPE_P (expr))
149 TYPE_ARTIFICIAL (expr) = (unsigned) bp_unpack_value (bp, 1);
150 else
151 TREE_NO_WARNING (expr) = (unsigned) bp_unpack_value (bp, 1);
152 TREE_NOTHROW (expr) = (unsigned) bp_unpack_value (bp, 1);
153 TREE_STATIC (expr) = (unsigned) bp_unpack_value (bp, 1);
154 if (TREE_CODE (expr) != TREE_BINFO)
155 TREE_PRIVATE (expr) = (unsigned) bp_unpack_value (bp, 1);
156 else
157 bp_unpack_value (bp, 1);
158 TREE_PROTECTED (expr) = (unsigned) bp_unpack_value (bp, 1);
159 TREE_DEPRECATED (expr) = (unsigned) bp_unpack_value (bp, 1);
160 if (TYPE_P (expr))
161 {
162 TYPE_SATURATING (expr) = (unsigned) bp_unpack_value (bp, 1);
163 TYPE_ADDR_SPACE (expr) = (unsigned) bp_unpack_value (bp, 8);
164 }
165 else if (TREE_CODE (expr) == SSA_NAME)
166 {
167 SSA_NAME_IS_DEFAULT_DEF (expr) = (unsigned) bp_unpack_value (bp, 1);
168 bp_unpack_value (bp, 8);
169 }
170 else
171 bp_unpack_value (bp, 9);
172 }
173
174
175 /* Unpack all the non-pointer fields of the TS_INT_CST structure of
176 expression EXPR from bitpack BP. */
177
178 static void
179 unpack_ts_int_cst_value_fields (struct bitpack_d *bp, tree expr)
180 {
181 int i;
182 for (i = 0; i < TREE_INT_CST_EXT_NUNITS (expr); i++)
183 TREE_INT_CST_ELT (expr, i) = bp_unpack_var_len_int (bp);
184 }
185
186
187 /* Unpack all the non-pointer fields of the TS_REAL_CST structure of
188 expression EXPR from bitpack BP. */
189
190 static void
191 unpack_ts_real_cst_value_fields (struct bitpack_d *bp, tree expr)
192 {
193 unsigned i;
194 REAL_VALUE_TYPE r;
195 REAL_VALUE_TYPE *rp;
196
197 /* Clear all bits of the real value type so that we can later do
198 bitwise comparisons to see if two values are the same. */
199 memset (&r, 0, sizeof r);
200 r.cl = (unsigned) bp_unpack_value (bp, 2);
201 r.decimal = (unsigned) bp_unpack_value (bp, 1);
202 r.sign = (unsigned) bp_unpack_value (bp, 1);
203 r.signalling = (unsigned) bp_unpack_value (bp, 1);
204 r.canonical = (unsigned) bp_unpack_value (bp, 1);
205 r.uexp = (unsigned) bp_unpack_value (bp, EXP_BITS);
206 for (i = 0; i < SIGSZ; i++)
207 r.sig[i] = (unsigned long) bp_unpack_value (bp, HOST_BITS_PER_LONG);
208
209 rp = ggc_alloc<real_value> ();
210 memcpy (rp, &r, sizeof (REAL_VALUE_TYPE));
211 TREE_REAL_CST_PTR (expr) = rp;
212 }
213
214
215 /* Unpack all the non-pointer fields of the TS_FIXED_CST structure of
216 expression EXPR from bitpack BP. */
217
218 static void
219 unpack_ts_fixed_cst_value_fields (struct bitpack_d *bp, tree expr)
220 {
221 FIXED_VALUE_TYPE *fp = ggc_alloc<fixed_value> ();
222 fp->mode = bp_unpack_machine_mode (bp);
223 fp->data.low = bp_unpack_var_len_int (bp);
224 fp->data.high = bp_unpack_var_len_int (bp);
225 TREE_FIXED_CST_PTR (expr) = fp;
226 }
227
228 /* Unpack all the non-pointer fields of the TS_DECL_COMMON structure
229 of expression EXPR from bitpack BP. */
230
231 static void
232 unpack_ts_decl_common_value_fields (struct bitpack_d *bp, tree expr)
233 {
234 DECL_MODE (expr) = bp_unpack_machine_mode (bp);
235 DECL_NONLOCAL (expr) = (unsigned) bp_unpack_value (bp, 1);
236 DECL_VIRTUAL_P (expr) = (unsigned) bp_unpack_value (bp, 1);
237 DECL_IGNORED_P (expr) = (unsigned) bp_unpack_value (bp, 1);
238 DECL_ABSTRACT_P (expr) = (unsigned) bp_unpack_value (bp, 1);
239 DECL_ARTIFICIAL (expr) = (unsigned) bp_unpack_value (bp, 1);
240 DECL_USER_ALIGN (expr) = (unsigned) bp_unpack_value (bp, 1);
241 DECL_PRESERVE_P (expr) = (unsigned) bp_unpack_value (bp, 1);
242 DECL_EXTERNAL (expr) = (unsigned) bp_unpack_value (bp, 1);
243 DECL_GIMPLE_REG_P (expr) = (unsigned) bp_unpack_value (bp, 1);
244 DECL_ALIGN (expr) = (unsigned) bp_unpack_var_len_unsigned (bp);
245 #ifdef ACCEL_COMPILER
246 if (DECL_ALIGN (expr) > targetm.absolute_biggest_alignment)
247 DECL_ALIGN (expr) = targetm.absolute_biggest_alignment;
248 #endif
249 if (TREE_CODE (expr) == LABEL_DECL)
250 {
251 EH_LANDING_PAD_NR (expr) = (int) bp_unpack_var_len_unsigned (bp);
252
253 /* Always assume an initial value of -1 for LABEL_DECL_UID to
254 force gimple_set_bb to recreate label_to_block_map. */
255 LABEL_DECL_UID (expr) = -1;
256 }
257
258 if (TREE_CODE (expr) == FIELD_DECL)
259 {
260 DECL_PACKED (expr) = (unsigned) bp_unpack_value (bp, 1);
261 DECL_NONADDRESSABLE_P (expr) = (unsigned) bp_unpack_value (bp, 1);
262 expr->decl_common.off_align = bp_unpack_value (bp, 8);
263 }
264
265 if (TREE_CODE (expr) == VAR_DECL)
266 {
267 DECL_HAS_DEBUG_EXPR_P (expr) = (unsigned) bp_unpack_value (bp, 1);
268 DECL_NONLOCAL_FRAME (expr) = (unsigned) bp_unpack_value (bp, 1);
269 }
270
271 if (TREE_CODE (expr) == RESULT_DECL
272 || TREE_CODE (expr) == PARM_DECL
273 || TREE_CODE (expr) == VAR_DECL)
274 {
275 DECL_BY_REFERENCE (expr) = (unsigned) bp_unpack_value (bp, 1);
276 if (TREE_CODE (expr) == VAR_DECL
277 || 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
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
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 (TREE_CODE (expr) == VAR_DECL)
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
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
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 (expr) = (unsigned) bp_unpack_value (bp, 1);
378 TYPE_NEEDS_CONSTRUCTING (expr) = (unsigned) bp_unpack_value (bp, 1);
379 if (RECORD_OR_UNION_TYPE_P (expr))
380 {
381 TYPE_TRANSPARENT_AGGR (expr) = (unsigned) bp_unpack_value (bp, 1);
382 TYPE_FINAL_P (expr) = (unsigned) bp_unpack_value (bp, 1);
383 }
384 else if (TREE_CODE (expr) == ARRAY_TYPE)
385 TYPE_NONALIASED_COMPONENT (expr) = (unsigned) bp_unpack_value (bp, 1);
386 TYPE_PACKED (expr) = (unsigned) bp_unpack_value (bp, 1);
387 TYPE_RESTRICT (expr) = (unsigned) bp_unpack_value (bp, 1);
388 TYPE_USER_ALIGN (expr) = (unsigned) bp_unpack_value (bp, 1);
389 TYPE_READONLY (expr) = (unsigned) bp_unpack_value (bp, 1);
390 TYPE_PRECISION (expr) = bp_unpack_var_len_unsigned (bp);
391 TYPE_ALIGN (expr) = bp_unpack_var_len_unsigned (bp);
392 #ifdef ACCEL_COMPILER
393 if (TYPE_ALIGN (expr) > targetm.absolute_biggest_alignment)
394 TYPE_ALIGN (expr) = targetm.absolute_biggest_alignment;
395 #endif
396 TYPE_ALIAS_SET (expr) = bp_unpack_var_len_int (bp);
397 }
398
399
400 /* Unpack all the non-pointer fields of the TS_BLOCK structure
401 of expression EXPR from bitpack BP. */
402
403 static void
404 unpack_ts_block_value_fields (struct data_in *data_in,
405 struct bitpack_d *bp, tree expr)
406 {
407 BLOCK_ABSTRACT (expr) = (unsigned) bp_unpack_value (bp, 1);
408 /* BLOCK_NUMBER is recomputed. */
409 stream_input_location (&BLOCK_SOURCE_LOCATION (expr), bp, data_in);
410 }
411
412 /* Unpack all the non-pointer fields of the TS_TRANSLATION_UNIT_DECL
413 structure of expression EXPR from bitpack BP. */
414
415 static void
416 unpack_ts_translation_unit_decl_value_fields (struct data_in *data_in,
417 struct bitpack_d *bp, tree expr)
418 {
419 TRANSLATION_UNIT_LANGUAGE (expr) = xstrdup (bp_unpack_string (data_in, bp));
420 vec_safe_push (all_translation_units, expr);
421 }
422
423
424 /* Unpack all the non-pointer fields of the TS_OMP_CLAUSE
425 structure of expression EXPR from bitpack BP. */
426
427 static void
428 unpack_ts_omp_clause_value_fields (struct data_in *data_in,
429 struct bitpack_d *bp, tree expr)
430 {
431 stream_input_location (&OMP_CLAUSE_LOCATION (expr), bp, data_in);
432 switch (OMP_CLAUSE_CODE (expr))
433 {
434 case OMP_CLAUSE_DEFAULT:
435 OMP_CLAUSE_DEFAULT_KIND (expr)
436 = bp_unpack_enum (bp, omp_clause_default_kind,
437 OMP_CLAUSE_DEFAULT_LAST);
438 break;
439 case OMP_CLAUSE_SCHEDULE:
440 OMP_CLAUSE_SCHEDULE_KIND (expr)
441 = bp_unpack_enum (bp, omp_clause_schedule_kind,
442 OMP_CLAUSE_SCHEDULE_LAST);
443 break;
444 case OMP_CLAUSE_DEPEND:
445 OMP_CLAUSE_DEPEND_KIND (expr)
446 = bp_unpack_enum (bp, omp_clause_depend_kind, OMP_CLAUSE_DEPEND_LAST);
447 break;
448 case OMP_CLAUSE_MAP:
449 OMP_CLAUSE_SET_MAP_KIND (expr, bp_unpack_enum (bp, gomp_map_kind,
450 GOMP_MAP_LAST));
451 break;
452 case OMP_CLAUSE_PROC_BIND:
453 OMP_CLAUSE_PROC_BIND_KIND (expr)
454 = bp_unpack_enum (bp, omp_clause_proc_bind_kind,
455 OMP_CLAUSE_PROC_BIND_LAST);
456 break;
457 case OMP_CLAUSE_REDUCTION:
458 OMP_CLAUSE_REDUCTION_CODE (expr)
459 = bp_unpack_enum (bp, tree_code, MAX_TREE_CODES);
460 break;
461 default:
462 break;
463 }
464 }
465
466
467 /* Read all the language-independent bitfield values for EXPR from IB.
468 Return the partially unpacked bitpack so the caller can unpack any other
469 bitfield values that the writer may have written. */
470
471 void
472 streamer_read_tree_bitfields (struct lto_input_block *ib,
473 struct data_in *data_in, tree expr)
474 {
475 enum tree_code code;
476 struct bitpack_d bp;
477
478 /* Read the bitpack of non-pointer values from IB. */
479 bp = streamer_read_bitpack (ib);
480
481 /* The first word in BP contains the code of the tree that we
482 are about to read. */
483 code = (enum tree_code) bp_unpack_value (&bp, 16);
484 lto_tag_check (lto_tree_code_to_tag (code),
485 lto_tree_code_to_tag (TREE_CODE (expr)));
486
487 /* Note that all these functions are highly sensitive to changes in
488 the types and sizes of each of the fields being packed. */
489 unpack_ts_base_value_fields (&bp, expr);
490
491 if (CODE_CONTAINS_STRUCT (code, TS_INT_CST))
492 unpack_ts_int_cst_value_fields (&bp, expr);
493
494 if (CODE_CONTAINS_STRUCT (code, TS_REAL_CST))
495 unpack_ts_real_cst_value_fields (&bp, expr);
496
497 if (CODE_CONTAINS_STRUCT (code, TS_FIXED_CST))
498 unpack_ts_fixed_cst_value_fields (&bp, expr);
499
500 if (CODE_CONTAINS_STRUCT (code, TS_DECL_MINIMAL))
501 stream_input_location (&DECL_SOURCE_LOCATION (expr), &bp, data_in);
502
503 if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
504 unpack_ts_decl_common_value_fields (&bp, expr);
505
506 if (CODE_CONTAINS_STRUCT (code, TS_DECL_WRTL))
507 unpack_ts_decl_wrtl_value_fields (&bp, expr);
508
509 if (CODE_CONTAINS_STRUCT (code, TS_DECL_WITH_VIS))
510 unpack_ts_decl_with_vis_value_fields (&bp, expr);
511
512 if (CODE_CONTAINS_STRUCT (code, TS_FUNCTION_DECL))
513 unpack_ts_function_decl_value_fields (&bp, expr);
514
515 if (CODE_CONTAINS_STRUCT (code, TS_TYPE_COMMON))
516 unpack_ts_type_common_value_fields (&bp, expr);
517
518 if (CODE_CONTAINS_STRUCT (code, TS_EXP))
519 {
520 stream_input_location (&EXPR_CHECK (expr)->exp.locus, &bp, data_in);
521 if (code == MEM_REF
522 || code == TARGET_MEM_REF)
523 {
524 MR_DEPENDENCE_CLIQUE (expr)
525 = (unsigned)bp_unpack_value (&bp, sizeof (short) * 8);
526 if (MR_DEPENDENCE_CLIQUE (expr) != 0)
527 MR_DEPENDENCE_BASE (expr)
528 = (unsigned)bp_unpack_value (&bp, sizeof (short) * 8);
529 }
530 }
531
532 if (CODE_CONTAINS_STRUCT (code, TS_BLOCK))
533 unpack_ts_block_value_fields (data_in, &bp, expr);
534
535 if (CODE_CONTAINS_STRUCT (code, TS_TRANSLATION_UNIT_DECL))
536 unpack_ts_translation_unit_decl_value_fields (data_in, &bp, expr);
537
538 if (CODE_CONTAINS_STRUCT (code, TS_OPTIMIZATION))
539 cl_optimization_stream_in (&bp, TREE_OPTIMIZATION (expr));
540
541 if (CODE_CONTAINS_STRUCT (code, TS_BINFO))
542 {
543 unsigned HOST_WIDE_INT length = bp_unpack_var_len_unsigned (&bp);
544 if (length > 0)
545 vec_safe_grow (BINFO_BASE_ACCESSES (expr), length);
546 }
547
548 if (CODE_CONTAINS_STRUCT (code, TS_CONSTRUCTOR))
549 {
550 unsigned HOST_WIDE_INT length = bp_unpack_var_len_unsigned (&bp);
551 if (length > 0)
552 vec_safe_grow (CONSTRUCTOR_ELTS (expr), length);
553 }
554
555 #ifndef ACCEL_COMPILER
556 if (CODE_CONTAINS_STRUCT (code, TS_TARGET_OPTION))
557 {
558 cl_target_option_stream_in (data_in, &bp, TREE_TARGET_OPTION (expr));
559 if (targetm.target_option.post_stream_in)
560 targetm.target_option.post_stream_in (TREE_TARGET_OPTION (expr));
561 }
562 #endif
563
564 if (code == OMP_CLAUSE)
565 unpack_ts_omp_clause_value_fields (data_in, &bp, expr);
566 }
567
568
569 /* Materialize a new tree from input block IB using descriptors in
570 DATA_IN. The code for the new tree should match TAG. Store in
571 *IX_P the index into the reader cache where the new tree is stored. */
572
573 tree
574 streamer_alloc_tree (struct lto_input_block *ib, struct data_in *data_in,
575 enum LTO_tags tag)
576 {
577 enum tree_code code;
578 tree result;
579 #ifdef LTO_STREAMER_DEBUG
580 HOST_WIDE_INT orig_address_in_writer;
581 #endif
582
583 result = NULL_TREE;
584
585 #ifdef LTO_STREAMER_DEBUG
586 /* Read the word representing the memory address for the tree
587 as it was written by the writer. This is useful when
588 debugging differences between the writer and reader. */
589 orig_address_in_writer = streamer_read_hwi (ib);
590 gcc_assert ((intptr_t) orig_address_in_writer == orig_address_in_writer);
591 #endif
592
593 code = lto_tag_to_tree_code (tag);
594
595 /* We should never see an SSA_NAME tree. Only the version numbers of
596 SSA names are ever written out. See input_ssa_names. */
597 gcc_assert (code != SSA_NAME);
598
599 /* Instantiate a new tree using the header data. */
600 if (CODE_CONTAINS_STRUCT (code, TS_STRING))
601 result = streamer_read_string_cst (data_in, ib);
602 else if (CODE_CONTAINS_STRUCT (code, TS_IDENTIFIER))
603 result = input_identifier (data_in, ib);
604 else if (CODE_CONTAINS_STRUCT (code, TS_VEC))
605 {
606 HOST_WIDE_INT len = streamer_read_hwi (ib);
607 result = make_tree_vec (len);
608 }
609 else if (CODE_CONTAINS_STRUCT (code, TS_VECTOR))
610 {
611 HOST_WIDE_INT len = streamer_read_hwi (ib);
612 result = make_vector (len);
613 }
614 else if (CODE_CONTAINS_STRUCT (code, TS_BINFO))
615 {
616 unsigned HOST_WIDE_INT len = streamer_read_uhwi (ib);
617 result = make_tree_binfo (len);
618 }
619 else if (CODE_CONTAINS_STRUCT (code, TS_INT_CST))
620 {
621 unsigned HOST_WIDE_INT len = streamer_read_uhwi (ib);
622 unsigned HOST_WIDE_INT ext_len = streamer_read_uhwi (ib);
623 result = make_int_cst (len, ext_len);
624 }
625 else if (code == CALL_EXPR)
626 {
627 unsigned HOST_WIDE_INT nargs = streamer_read_uhwi (ib);
628 return build_vl_exp (CALL_EXPR, nargs + 3);
629 }
630 else if (code == OMP_CLAUSE)
631 {
632 enum omp_clause_code subcode
633 = (enum omp_clause_code) streamer_read_uhwi (ib);
634 return build_omp_clause (UNKNOWN_LOCATION, subcode);
635 }
636 else
637 {
638 /* For all other nodes, materialize the tree with a raw
639 make_node call. */
640 result = make_node (code);
641 }
642
643 #ifdef LTO_STREAMER_DEBUG
644 /* Store the original address of the tree as seen by the writer
645 in RESULT's aux field. This is useful when debugging streaming
646 problems. This way, a debugging session can be started on
647 both writer and reader with a breakpoint using this address
648 value in both. */
649 lto_orig_address_map (result, (intptr_t) orig_address_in_writer);
650 #endif
651
652 return result;
653 }
654
655
656 /* Read all pointer fields in the TS_COMMON structure of EXPR from input
657 block IB. DATA_IN contains tables and descriptors for the
658 file being read. */
659
660
661 static void
662 lto_input_ts_common_tree_pointers (struct lto_input_block *ib,
663 struct data_in *data_in, tree expr)
664 {
665 if (TREE_CODE (expr) != IDENTIFIER_NODE)
666 TREE_TYPE (expr) = stream_read_tree (ib, data_in);
667 }
668
669
670 /* Read all pointer fields in the TS_VECTOR structure of EXPR from input
671 block IB. DATA_IN contains tables and descriptors for the
672 file being read. */
673
674 static void
675 lto_input_ts_vector_tree_pointers (struct lto_input_block *ib,
676 struct data_in *data_in, tree expr)
677 {
678 unsigned i;
679 for (i = 0; i < VECTOR_CST_NELTS (expr); ++i)
680 VECTOR_CST_ELT (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
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
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
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
722 /* Do not stream DECL_ABSTRACT_ORIGIN. We cannot handle debug information
723 for early inlining so drop it on the floor instead of ICEing in
724 dwarf2out.c. */
725
726 if ((TREE_CODE (expr) == VAR_DECL
727 || TREE_CODE (expr) == PARM_DECL)
728 && DECL_HAS_VALUE_EXPR_P (expr))
729 SET_DECL_VALUE_EXPR (expr, stream_read_tree (ib, data_in));
730
731 if (TREE_CODE (expr) == VAR_DECL)
732 {
733 tree dexpr = stream_read_tree (ib, data_in);
734 if (dexpr)
735 SET_DECL_DEBUG_EXPR (expr, dexpr);
736 }
737 }
738
739
740 /* Read all pointer fields in the TS_DECL_NON_COMMON structure of
741 EXPR from input block IB. DATA_IN contains tables and descriptors for the
742 file being read. */
743
744 static void
745 lto_input_ts_decl_non_common_tree_pointers (struct lto_input_block *ib,
746 struct data_in *data_in, tree expr)
747 {
748 if (TREE_CODE (expr) == TYPE_DECL)
749 DECL_ORIGINAL_TYPE (expr) = stream_read_tree (ib, data_in);
750 }
751
752
753 /* Read all pointer fields in the TS_DECL_WITH_VIS structure of EXPR
754 from input block IB. DATA_IN contains tables and descriptors for the
755 file being read. */
756
757 static void
758 lto_input_ts_decl_with_vis_tree_pointers (struct lto_input_block *ib,
759 struct data_in *data_in, tree expr)
760 {
761 tree id;
762
763 id = stream_read_tree (ib, data_in);
764 if (id)
765 {
766 gcc_assert (TREE_CODE (id) == IDENTIFIER_NODE);
767 SET_DECL_ASSEMBLER_NAME (expr, id);
768 }
769 }
770
771
772 /* Read all pointer fields in the TS_FIELD_DECL structure of EXPR from
773 input block IB. DATA_IN contains tables and descriptors for the
774 file being read. */
775
776 static void
777 lto_input_ts_field_decl_tree_pointers (struct lto_input_block *ib,
778 struct data_in *data_in, tree expr)
779 {
780 DECL_FIELD_OFFSET (expr) = stream_read_tree (ib, data_in);
781 DECL_BIT_FIELD_TYPE (expr) = stream_read_tree (ib, data_in);
782 DECL_BIT_FIELD_REPRESENTATIVE (expr) = stream_read_tree (ib, data_in);
783 DECL_FIELD_BIT_OFFSET (expr) = stream_read_tree (ib, data_in);
784 DECL_FCONTEXT (expr) = stream_read_tree (ib, data_in);
785 }
786
787
788 /* Read all pointer fields in the TS_FUNCTION_DECL structure of EXPR
789 from input block IB. DATA_IN contains tables and descriptors for the
790 file being read. */
791
792 static void
793 lto_input_ts_function_decl_tree_pointers (struct lto_input_block *ib,
794 struct data_in *data_in, tree expr)
795 {
796 DECL_VINDEX (expr) = stream_read_tree (ib, data_in);
797 /* DECL_STRUCT_FUNCTION is loaded on demand by cgraph_get_body. */
798 DECL_FUNCTION_PERSONALITY (expr) = stream_read_tree (ib, data_in);
799 #ifndef ACCEL_COMPILER
800 DECL_FUNCTION_SPECIFIC_TARGET (expr) = stream_read_tree (ib, data_in);
801 #endif
802 DECL_FUNCTION_SPECIFIC_OPTIMIZATION (expr) = stream_read_tree (ib, data_in);
803
804 /* If the file contains a function with an EH personality set,
805 then it was compiled with -fexceptions. In that case, initialize
806 the backend EH machinery. */
807 if (DECL_FUNCTION_PERSONALITY (expr))
808 lto_init_eh ();
809 }
810
811
812 /* Read all pointer fields in the TS_TYPE_COMMON structure of EXPR from
813 input block IB. DATA_IN contains tables and descriptors for the file
814 being read. */
815
816 static void
817 lto_input_ts_type_common_tree_pointers (struct lto_input_block *ib,
818 struct data_in *data_in, tree expr)
819 {
820 TYPE_SIZE (expr) = stream_read_tree (ib, data_in);
821 TYPE_SIZE_UNIT (expr) = stream_read_tree (ib, data_in);
822 TYPE_ATTRIBUTES (expr) = stream_read_tree (ib, data_in);
823 TYPE_NAME (expr) = stream_read_tree (ib, data_in);
824 /* Do not stream TYPE_POINTER_TO or TYPE_REFERENCE_TO. They will be
825 reconstructed during fixup. */
826 /* Do not stream TYPE_NEXT_VARIANT, we reconstruct the variant lists
827 during fixup. */
828 TYPE_MAIN_VARIANT (expr) = stream_read_tree (ib, data_in);
829 TYPE_CONTEXT (expr) = stream_read_tree (ib, data_in);
830 /* TYPE_CANONICAL gets re-computed during type merging. */
831 TYPE_CANONICAL (expr) = NULL_TREE;
832 TYPE_STUB_DECL (expr) = stream_read_tree (ib, data_in);
833 }
834
835 /* Read all pointer fields in the TS_TYPE_NON_COMMON structure of EXPR
836 from input block IB. DATA_IN contains tables and descriptors for the
837 file being read. */
838
839 static void
840 lto_input_ts_type_non_common_tree_pointers (struct lto_input_block *ib,
841 struct data_in *data_in,
842 tree expr)
843 {
844 if (TREE_CODE (expr) == ENUMERAL_TYPE)
845 TYPE_VALUES (expr) = stream_read_tree (ib, data_in);
846 else if (TREE_CODE (expr) == ARRAY_TYPE)
847 TYPE_DOMAIN (expr) = stream_read_tree (ib, data_in);
848 else if (RECORD_OR_UNION_TYPE_P (expr))
849 TYPE_FIELDS (expr) = streamer_read_chain (ib, data_in);
850 else if (TREE_CODE (expr) == FUNCTION_TYPE
851 || TREE_CODE (expr) == METHOD_TYPE)
852 TYPE_ARG_TYPES (expr) = stream_read_tree (ib, data_in);
853
854 if (!POINTER_TYPE_P (expr))
855 TYPE_MINVAL (expr) = stream_read_tree (ib, data_in);
856 TYPE_MAXVAL (expr) = stream_read_tree (ib, data_in);
857 if (RECORD_OR_UNION_TYPE_P (expr))
858 TYPE_BINFO (expr) = stream_read_tree (ib, data_in);
859 }
860
861
862 /* Read all pointer fields in the TS_LIST structure of EXPR from input
863 block IB. DATA_IN contains tables and descriptors for the
864 file being read. */
865
866 static void
867 lto_input_ts_list_tree_pointers (struct lto_input_block *ib,
868 struct data_in *data_in, tree expr)
869 {
870 TREE_PURPOSE (expr) = stream_read_tree (ib, data_in);
871 TREE_VALUE (expr) = stream_read_tree (ib, data_in);
872 TREE_CHAIN (expr) = stream_read_tree (ib, data_in);
873 }
874
875
876 /* Read all pointer fields in the TS_VEC structure of EXPR from input
877 block IB. DATA_IN contains tables and descriptors for the
878 file being read. */
879
880 static void
881 lto_input_ts_vec_tree_pointers (struct lto_input_block *ib,
882 struct data_in *data_in, tree expr)
883 {
884 int i;
885
886 /* Note that TREE_VEC_LENGTH was read by streamer_alloc_tree to
887 instantiate EXPR. */
888 for (i = 0; i < TREE_VEC_LENGTH (expr); i++)
889 TREE_VEC_ELT (expr, i) = stream_read_tree (ib, data_in);
890 }
891
892
893 /* Read all pointer fields in the TS_EXP structure of EXPR from input
894 block IB. DATA_IN contains tables and descriptors for the
895 file being read. */
896
897
898 static void
899 lto_input_ts_exp_tree_pointers (struct lto_input_block *ib,
900 struct data_in *data_in, tree expr)
901 {
902 int i;
903 tree block;
904
905 for (i = 0; i < TREE_OPERAND_LENGTH (expr); i++)
906 TREE_OPERAND (expr, i) = stream_read_tree (ib, data_in);
907
908 block = stream_read_tree (ib, data_in);
909
910 /* TODO: Block is stored in the locus information. It may make more sense to
911 to make it go via the location cache. */
912 if (block)
913 {
914 data_in->location_cache.apply_location_cache ();
915 TREE_SET_BLOCK (expr, block);
916 }
917 }
918
919
920 /* Read all pointer fields in the TS_BLOCK structure of EXPR from input
921 block IB. DATA_IN contains tables and descriptors for the
922 file being read. */
923
924 static void
925 lto_input_ts_block_tree_pointers (struct lto_input_block *ib,
926 struct data_in *data_in, tree expr)
927 {
928 BLOCK_VARS (expr) = streamer_read_chain (ib, data_in);
929
930 BLOCK_SUPERCONTEXT (expr) = stream_read_tree (ib, data_in);
931
932 /* Stream BLOCK_ABSTRACT_ORIGIN and BLOCK_SOURCE_LOCATION for
933 the limited cases we can handle - those that represent inlined
934 function scopes. For the rest them on the floor instead of ICEing in
935 dwarf2out.c. */
936 BLOCK_ABSTRACT_ORIGIN (expr) = stream_read_tree (ib, data_in);
937 /* Do not stream BLOCK_NONLOCALIZED_VARS. We cannot handle debug information
938 for early inlined BLOCKs so drop it on the floor instead of ICEing in
939 dwarf2out.c. */
940
941 /* BLOCK_FRAGMENT_ORIGIN and BLOCK_FRAGMENT_CHAIN is not live at LTO
942 streaming time. */
943
944 /* We re-compute BLOCK_SUBBLOCKS of our parent here instead
945 of streaming it. For non-BLOCK BLOCK_SUPERCONTEXTs we still
946 stream the child relationship explicitly. */
947 if (BLOCK_SUPERCONTEXT (expr)
948 && TREE_CODE (BLOCK_SUPERCONTEXT (expr)) == BLOCK)
949 {
950 BLOCK_CHAIN (expr) = BLOCK_SUBBLOCKS (BLOCK_SUPERCONTEXT (expr));
951 BLOCK_SUBBLOCKS (BLOCK_SUPERCONTEXT (expr)) = expr;
952 }
953
954 /* The global block is rooted at the TU decl. Hook it here to
955 avoid the need to stream in this block during WPA time. */
956 else if (BLOCK_SUPERCONTEXT (expr)
957 && TREE_CODE (BLOCK_SUPERCONTEXT (expr)) == TRANSLATION_UNIT_DECL)
958 DECL_INITIAL (BLOCK_SUPERCONTEXT (expr)) = expr;
959
960 /* The function-level block is connected at the time we read in
961 function bodies for the same reason. */
962 }
963
964
965 /* Read all pointer fields in the TS_BINFO structure of EXPR from input
966 block IB. DATA_IN contains tables and descriptors for the
967 file being read. */
968
969 static void
970 lto_input_ts_binfo_tree_pointers (struct lto_input_block *ib,
971 struct data_in *data_in, tree expr)
972 {
973 unsigned i;
974 tree t;
975
976 /* Note that the number of slots in EXPR was read in
977 streamer_alloc_tree when instantiating EXPR. However, the
978 vector is empty so we cannot rely on vec::length to know how many
979 elements to read. So, this list is emitted as a 0-terminated
980 list on the writer side. */
981 do
982 {
983 t = stream_read_tree (ib, data_in);
984 if (t)
985 BINFO_BASE_BINFOS (expr)->quick_push (t);
986 }
987 while (t);
988
989 BINFO_OFFSET (expr) = stream_read_tree (ib, data_in);
990 BINFO_VTABLE (expr) = stream_read_tree (ib, data_in);
991 BINFO_VPTR_FIELD (expr) = stream_read_tree (ib, data_in);
992
993 /* The vector of BINFO_BASE_ACCESSES is pre-allocated during
994 unpacking the bitfield section. */
995 for (i = 0; i < vec_safe_length (BINFO_BASE_ACCESSES (expr)); i++)
996 {
997 tree a = stream_read_tree (ib, data_in);
998 (*BINFO_BASE_ACCESSES (expr))[i] = a;
999 }
1000 /* Do not walk BINFO_INHERITANCE_CHAIN, BINFO_SUBVTT_INDEX
1001 and BINFO_VPTR_INDEX; these are used by C++ FE 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
1010 lto_input_ts_constructor_tree_pointers (struct lto_input_block *ib,
1011 struct 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 (ib, data_in);
1019 e.value = stream_read_tree (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
1030 lto_input_ts_omp_clause_tree_pointers (struct lto_input_block *ib,
1031 struct 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 (ib, data_in);
1037 OMP_CLAUSE_CHAIN (expr) = stream_read_tree (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
1045 streamer_read_tree_body (struct lto_input_block *ib, struct 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_COMPLEX))
1059 lto_input_ts_complex_tree_pointers (ib, data_in, expr);
1060
1061 if (CODE_CONTAINS_STRUCT (code, TS_DECL_MINIMAL))
1062 lto_input_ts_decl_minimal_tree_pointers (ib, data_in, expr);
1063
1064 if (CODE_CONTAINS_STRUCT (code, TS_DECL_COMMON))
1065 lto_input_ts_decl_common_tree_pointers (ib, data_in, expr);
1066
1067 if (CODE_CONTAINS_STRUCT (code, TS_DECL_NON_COMMON))
1068 lto_input_ts_decl_non_common_tree_pointers (ib, data_in, expr);
1069
1070 if (CODE_CONTAINS_STRUCT (code, TS_DECL_WITH_VIS))
1071 lto_input_ts_decl_with_vis_tree_pointers (ib, data_in, expr);
1072
1073 if (CODE_CONTAINS_STRUCT (code, TS_FIELD_DECL))
1074 lto_input_ts_field_decl_tree_pointers (ib, data_in, expr);
1075
1076 if (CODE_CONTAINS_STRUCT (code, TS_FUNCTION_DECL))
1077 lto_input_ts_function_decl_tree_pointers (ib, data_in, expr);
1078
1079 if (CODE_CONTAINS_STRUCT (code, TS_TYPE_COMMON))
1080 lto_input_ts_type_common_tree_pointers (ib, data_in, expr);
1081
1082 if (CODE_CONTAINS_STRUCT (code, TS_TYPE_NON_COMMON))
1083 lto_input_ts_type_non_common_tree_pointers (ib, data_in, expr);
1084
1085 if (CODE_CONTAINS_STRUCT (code, TS_LIST))
1086 lto_input_ts_list_tree_pointers (ib, data_in, expr);
1087
1088 if (CODE_CONTAINS_STRUCT (code, TS_VEC))
1089 lto_input_ts_vec_tree_pointers (ib, data_in, expr);
1090
1091 if (CODE_CONTAINS_STRUCT (code, TS_EXP))
1092 lto_input_ts_exp_tree_pointers (ib, data_in, expr);
1093
1094 if (CODE_CONTAINS_STRUCT (code, TS_BLOCK))
1095 lto_input_ts_block_tree_pointers (ib, data_in, expr);
1096
1097 if (CODE_CONTAINS_STRUCT (code, TS_BINFO))
1098 lto_input_ts_binfo_tree_pointers (ib, data_in, expr);
1099
1100 if (CODE_CONTAINS_STRUCT (code, TS_CONSTRUCTOR))
1101 lto_input_ts_constructor_tree_pointers (ib, data_in, expr);
1102
1103 if (code == OMP_CLAUSE)
1104 lto_input_ts_omp_clause_tree_pointers (ib, data_in, expr);
1105 }
1106
1107
1108 /* Read an index IX from input block IB and return the tree node at
1109 DATA_IN->FILE_DATA->GLOBALS_INDEX[IX]. */
1110
1111 tree
1112 streamer_get_pickled_tree (struct lto_input_block *ib, struct data_in *data_in)
1113 {
1114 unsigned HOST_WIDE_INT ix;
1115 tree result;
1116 enum LTO_tags expected_tag;
1117
1118 ix = streamer_read_uhwi (ib);
1119 expected_tag = streamer_read_enum (ib, LTO_tags, LTO_NUM_TAGS);
1120
1121 result = streamer_tree_cache_get_tree (data_in->reader_cache, ix);
1122 gcc_assert (result
1123 && TREE_CODE (result) == lto_tag_to_tree_code (expected_tag));
1124
1125 return result;
1126 }
1127
1128
1129 /* Read a code and class from input block IB and return the
1130 corresponding builtin. DATA_IN is as in stream_read_tree. */
1131
1132 tree
1133 streamer_get_builtin_tree (struct lto_input_block *ib, struct data_in *data_in)
1134 {
1135 enum built_in_class fclass;
1136 enum built_in_function fcode;
1137 const char *asmname;
1138 tree result;
1139
1140 fclass = streamer_read_enum (ib, built_in_class, BUILT_IN_LAST);
1141 gcc_assert (fclass == BUILT_IN_NORMAL || fclass == BUILT_IN_MD);
1142
1143 fcode = (enum built_in_function) streamer_read_uhwi (ib);
1144
1145 if (fclass == BUILT_IN_NORMAL)
1146 {
1147 if (fcode >= END_BUILTINS)
1148 fatal_error (input_location,
1149 "machine independent builtin code out of range");
1150 result = builtin_decl_explicit (fcode);
1151 if (!result
1152 && fcode > BEGIN_CHKP_BUILTINS
1153 && fcode < END_CHKP_BUILTINS)
1154 {
1155 fcode = (enum built_in_function) (fcode - BEGIN_CHKP_BUILTINS - 1);
1156 result = builtin_decl_explicit (fcode);
1157 result = chkp_maybe_clone_builtin_fndecl (result);
1158 }
1159 gcc_assert (result);
1160 }
1161 else if (fclass == BUILT_IN_MD)
1162 {
1163 result = targetm.builtin_decl (fcode, true);
1164 if (!result || result == error_mark_node)
1165 fatal_error (input_location, "target specific builtin not available");
1166 }
1167 else
1168 gcc_unreachable ();
1169
1170 asmname = streamer_read_string (data_in, ib);
1171 if (asmname)
1172 set_builtin_user_assembler_name (result, asmname);
1173
1174 streamer_tree_cache_append (data_in->reader_cache, result, 0);
1175
1176 return result;
1177 }