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