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