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