1 |
684 |
jeremybenn |
/* Data structures and functions for streaming trees.
|
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 |
|
|
#ifndef GCC_TREE_STREAMER_H
|
23 |
|
|
#define GCC_TREE_STREAMER_H
|
24 |
|
|
|
25 |
|
|
#include "tree.h"
|
26 |
|
|
#include "streamer-hooks.h"
|
27 |
|
|
#include "lto-streamer.h"
|
28 |
|
|
|
29 |
|
|
/* Cache of pickled nodes. Used to avoid writing the same node more
|
30 |
|
|
than once. The first time a tree node is streamed out, it is
|
31 |
|
|
entered in this cache. Subsequent references to the same node are
|
32 |
|
|
resolved by looking it up in this cache.
|
33 |
|
|
|
34 |
|
|
This is used in two ways:
|
35 |
|
|
|
36 |
|
|
- On the writing side, the first time T is added to STREAMER_CACHE,
|
37 |
|
|
a new reference index is created for T and T is emitted on the
|
38 |
|
|
stream. If T needs to be emitted again to the stream, instead of
|
39 |
|
|
pickling it again, the reference index is emitted.
|
40 |
|
|
|
41 |
|
|
- On the reading side, the first time T is read from the stream, it
|
42 |
|
|
is reconstructed in memory and a new reference index created for
|
43 |
|
|
T. The reconstructed T is inserted in some array so that when
|
44 |
|
|
the reference index for T is found in the input stream, it can be
|
45 |
|
|
used to look up into the array to get the reconstructed T. */
|
46 |
|
|
struct streamer_tree_cache_d
|
47 |
|
|
{
|
48 |
|
|
/* The mapping between tree nodes and slots into the nodes array. */
|
49 |
|
|
struct pointer_map_t *node_map;
|
50 |
|
|
|
51 |
|
|
/* The nodes pickled so far. */
|
52 |
|
|
VEC(tree,heap) *nodes;
|
53 |
|
|
};
|
54 |
|
|
|
55 |
|
|
/* Return true if tree node EXPR should be streamed as a builtin. For
|
56 |
|
|
these nodes, we just emit the class and function code. */
|
57 |
|
|
static inline bool
|
58 |
|
|
streamer_handle_as_builtin_p (tree expr)
|
59 |
|
|
{
|
60 |
|
|
return (TREE_CODE (expr) == FUNCTION_DECL
|
61 |
|
|
&& DECL_IS_BUILTIN (expr)
|
62 |
|
|
&& (DECL_BUILT_IN_CLASS (expr) == BUILT_IN_NORMAL
|
63 |
|
|
|| DECL_BUILT_IN_CLASS (expr) == BUILT_IN_MD));
|
64 |
|
|
}
|
65 |
|
|
|
66 |
|
|
/* In tree-streamer-in.c. */
|
67 |
|
|
tree streamer_read_string_cst (struct data_in *, struct lto_input_block *);
|
68 |
|
|
tree streamer_read_chain (struct lto_input_block *, struct data_in *);
|
69 |
|
|
tree streamer_alloc_tree (struct lto_input_block *, struct data_in *,
|
70 |
|
|
enum LTO_tags);
|
71 |
|
|
void streamer_read_tree_body (struct lto_input_block *, struct data_in *, tree);
|
72 |
|
|
tree streamer_get_pickled_tree (struct lto_input_block *, struct data_in *);
|
73 |
|
|
tree streamer_get_builtin_tree (struct lto_input_block *, struct data_in *);
|
74 |
|
|
tree streamer_read_integer_cst (struct lto_input_block *, struct data_in *);
|
75 |
|
|
struct bitpack_d streamer_read_tree_bitfields (struct lto_input_block *, tree);
|
76 |
|
|
|
77 |
|
|
/* In tree-streamer-out.c. */
|
78 |
|
|
void streamer_write_string_cst (struct output_block *,
|
79 |
|
|
struct lto_output_stream *, tree);
|
80 |
|
|
void streamer_write_chain (struct output_block *, tree, bool);
|
81 |
|
|
void streamer_write_tree_header (struct output_block *, tree);
|
82 |
|
|
void streamer_pack_tree_bitfields (struct bitpack_d *, tree);
|
83 |
|
|
void streamer_write_tree_body (struct output_block *, tree, bool);
|
84 |
|
|
void streamer_write_integer_cst (struct output_block *, tree, bool);
|
85 |
|
|
void streamer_write_builtin (struct output_block *, tree);
|
86 |
|
|
|
87 |
|
|
/* In tree-streamer.c. */
|
88 |
|
|
void streamer_check_handled_ts_structures (void);
|
89 |
|
|
bool streamer_tree_cache_insert (struct streamer_tree_cache_d *, tree,
|
90 |
|
|
unsigned *);
|
91 |
|
|
bool streamer_tree_cache_insert_at (struct streamer_tree_cache_d *, tree,
|
92 |
|
|
unsigned);
|
93 |
|
|
void streamer_tree_cache_append (struct streamer_tree_cache_d *, tree);
|
94 |
|
|
bool streamer_tree_cache_lookup (struct streamer_tree_cache_d *, tree,
|
95 |
|
|
unsigned *);
|
96 |
|
|
tree streamer_tree_cache_get (struct streamer_tree_cache_d *, unsigned);
|
97 |
|
|
struct streamer_tree_cache_d *streamer_tree_cache_create (void);
|
98 |
|
|
void streamer_tree_cache_delete (struct streamer_tree_cache_d *);
|
99 |
|
|
|
100 |
|
|
#endif /* GCC_TREE_STREAMER_H */
|