mmap.c (MAP_FAILED): Define if not defined.
[official-gcc.git] / gcc / tree-streamer.h
blob41a76a28eb50084a0d9b85ef3ff04462db81d8b3
1 /* Data structures and functions for streaming trees.
3 Copyright (C) 2011-2016 Free Software Foundation, Inc.
4 Contributed by Diego Novillo <dnovillo@google.com>
6 This file is part of GCC.
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.
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.
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/>. */
22 #ifndef GCC_TREE_STREAMER_H
23 #define GCC_TREE_STREAMER_H
25 #include "streamer-hooks.h"
26 #include "data-streamer.h"
28 /* Cache of pickled nodes. Used to avoid writing the same node more
29 than once. The first time a tree node is streamed out, it is
30 entered in this cache. Subsequent references to the same node are
31 resolved by looking it up in this cache.
33 This is used in two ways:
35 - On the writing side, the first time T is added to STREAMER_CACHE,
36 a new reference index is created for T and T is emitted on the
37 stream. If T needs to be emitted again to the stream, instead of
38 pickling it again, the reference index is emitted.
40 - On the reading side, the first time T is read from the stream, it
41 is reconstructed in memory and a new reference index created for
42 T. The reconstructed T is inserted in some array so that when
43 the reference index for T is found in the input stream, it can be
44 used to look up into the array to get the reconstructed T. */
46 struct streamer_tree_cache_d
48 /* The mapping between tree nodes and slots into the nodes array. */
49 hash_map<tree, unsigned> *node_map;
51 /* The nodes pickled so far. */
52 vec<tree> nodes;
53 /* The node hashes (if available). */
54 vec<hashval_t> hashes;
56 /* Next index to assign. */
57 unsigned next_idx;
60 /* Return true if tree node EXPR should be streamed as a builtin. For
61 these nodes, we just emit the class and function code. */
62 static inline bool
63 streamer_handle_as_builtin_p (tree expr)
65 return (TREE_CODE (expr) == FUNCTION_DECL
66 && DECL_IS_BUILTIN (expr)
67 && (DECL_BUILT_IN_CLASS (expr) == BUILT_IN_NORMAL
68 || DECL_BUILT_IN_CLASS (expr) == BUILT_IN_MD));
71 /* In tree-streamer-in.c. */
72 tree streamer_read_string_cst (struct data_in *, struct lto_input_block *);
73 tree streamer_read_chain (struct lto_input_block *, struct data_in *);
74 tree streamer_alloc_tree (struct lto_input_block *, struct data_in *,
75 enum LTO_tags);
76 void streamer_read_tree_body (struct lto_input_block *, struct data_in *, tree);
77 tree streamer_get_pickled_tree (struct lto_input_block *, struct data_in *);
78 tree streamer_get_builtin_tree (struct lto_input_block *, struct data_in *);
79 void streamer_read_tree_bitfields (struct lto_input_block *,
80 struct data_in *, tree);
82 /* In tree-streamer-out.c. */
83 void streamer_write_string_cst (struct output_block *,
84 struct lto_output_stream *, tree);
85 void streamer_write_chain (struct output_block *, tree, bool);
86 void streamer_write_tree_header (struct output_block *, tree);
87 void streamer_write_tree_bitfields (struct output_block *, tree);
88 void streamer_write_tree_body (struct output_block *, tree, bool);
89 void streamer_write_integer_cst (struct output_block *, tree, bool);
90 void streamer_write_builtin (struct output_block *, tree);
92 /* In tree-streamer.c. */
93 extern unsigned char streamer_mode_table[1 << 8];
94 void streamer_check_handled_ts_structures (void);
95 bool streamer_tree_cache_insert (struct streamer_tree_cache_d *, tree,
96 hashval_t, unsigned *);
97 void streamer_tree_cache_replace_tree (struct streamer_tree_cache_d *, tree,
98 unsigned);
99 void streamer_tree_cache_append (struct streamer_tree_cache_d *, tree,
100 hashval_t);
101 bool streamer_tree_cache_lookup (struct streamer_tree_cache_d *, tree,
102 unsigned *);
103 struct streamer_tree_cache_d *streamer_tree_cache_create (bool, bool, bool);
104 void streamer_tree_cache_delete (struct streamer_tree_cache_d *);
106 /* Return the tree node at slot IX in CACHE. */
108 static inline tree
109 streamer_tree_cache_get_tree (struct streamer_tree_cache_d *cache, unsigned ix)
111 return cache->nodes[ix];
114 /* Return the tree hash value at slot IX in CACHE. */
116 static inline hashval_t
117 streamer_tree_cache_get_hash (struct streamer_tree_cache_d *cache, unsigned ix)
119 return cache->hashes[ix];
122 static inline void
123 bp_pack_machine_mode (struct bitpack_d *bp, machine_mode mode)
125 streamer_mode_table[mode] = 1;
126 bp_pack_enum (bp, machine_mode, 1 << 8, mode);
129 static inline machine_mode
130 bp_unpack_machine_mode (struct bitpack_d *bp)
132 return (machine_mode)
133 ((struct lto_input_block *)
134 bp->stream)->mode_table[bp_unpack_enum (bp, machine_mode, 1 << 8)];
137 #endif /* GCC_TREE_STREAMER_H */