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