diff options
author | alk3pInjection <webmaster@raspii.tech> | 2024-02-04 16:16:35 +0800 |
---|---|---|
committer | alk3pInjection <webmaster@raspii.tech> | 2024-02-04 16:16:35 +0800 |
commit | abdaadbcae30fe0c9a66c7516798279fdfd97750 (patch) | |
tree | 00a54a6e25601e43876d03c1a4a12a749d4a914c /lib/gcc/arm-none-eabi/13.2.1/plugin/include/tree-streamer.h |
https://developer.arm.com/downloads/-/arm-gnu-toolchain-downloads
Change-Id: I7303388733328cd98ab9aa3c30236db67f2e9e9c
Diffstat (limited to 'lib/gcc/arm-none-eabi/13.2.1/plugin/include/tree-streamer.h')
-rw-r--r-- | lib/gcc/arm-none-eabi/13.2.1/plugin/include/tree-streamer.h | 122 |
1 files changed, 122 insertions, 0 deletions
diff --git a/lib/gcc/arm-none-eabi/13.2.1/plugin/include/tree-streamer.h b/lib/gcc/arm-none-eabi/13.2.1/plugin/include/tree-streamer.h new file mode 100644 index 0000000..170d61c --- /dev/null +++ b/lib/gcc/arm-none-eabi/13.2.1/plugin/include/tree-streamer.h @@ -0,0 +1,122 @@ +/* Data structures and functions for streaming trees. + + Copyright (C) 2011-2023 Free Software Foundation, Inc. + Contributed by Diego Novillo <dnovillo@google.com> + +This file is part of GCC. + +GCC is free software; you can redistribute it and/or modify it under +the terms of the GNU General Public License as published by the Free +Software Foundation; either version 3, or (at your option) any later +version. + +GCC is distributed in the hope that it will be useful, but WITHOUT ANY +WARRANTY; without even the implied warranty of MERCHANTABILITY or +FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License +for more details. + +You should have received a copy of the GNU General Public License +along with GCC; see the file COPYING3. If not see +<http://www.gnu.org/licenses/>. */ + +#ifndef GCC_TREE_STREAMER_H +#define GCC_TREE_STREAMER_H + +#include "streamer-hooks.h" +#include "data-streamer.h" + +/* Cache of pickled nodes. Used to avoid writing the same node more + than once. The first time a tree node is streamed out, it is + entered in this cache. Subsequent references to the same node are + resolved by looking it up in this cache. + + This is used in two ways: + + - On the writing side, the first time T is added to STREAMER_CACHE, + a new reference index is created for T and T is emitted on the + stream. If T needs to be emitted again to the stream, instead of + pickling it again, the reference index is emitted. + + - On the reading side, the first time T is read from the stream, it + is reconstructed in memory and a new reference index created for + T. The reconstructed T is inserted in some array so that when + the reference index for T is found in the input stream, it can be + used to look up into the array to get the reconstructed T. */ + +struct streamer_tree_cache_d +{ + /* The mapping between tree nodes and slots into the nodes array. */ + hash_map<tree, unsigned> *node_map; + + /* The nodes pickled so far. */ + vec<tree> nodes; + /* The node hashes (if available). */ + vec<hashval_t> hashes; + + /* Next index to assign. */ + unsigned next_idx; +}; + +/* In tree-streamer-in.cc. */ +tree streamer_read_string_cst (class data_in *, class lto_input_block *); +tree streamer_alloc_tree (class lto_input_block *, class data_in *, + enum LTO_tags); +void streamer_read_tree_body (class lto_input_block *, class data_in *, tree); +tree streamer_get_pickled_tree (class lto_input_block *, class data_in *); +void streamer_read_tree_bitfields (class lto_input_block *, + class data_in *, tree); + +/* In tree-streamer-out.cc. */ +void streamer_write_string_cst (struct output_block *, + struct lto_output_stream *, tree); +void streamer_write_tree_header (struct output_block *, tree); +void streamer_write_tree_bitfields (struct output_block *, tree); +void streamer_write_tree_body (struct output_block *, tree); +void streamer_write_integer_cst (struct output_block *, tree); + +/* In tree-streamer.cc. */ +extern unsigned char streamer_mode_table[1 << 8]; +void streamer_check_handled_ts_structures (void); +bool streamer_tree_cache_insert (struct streamer_tree_cache_d *, tree, + hashval_t, unsigned *); +void streamer_tree_cache_replace_tree (struct streamer_tree_cache_d *, tree, + unsigned); +void streamer_tree_cache_append (struct streamer_tree_cache_d *, tree, + hashval_t); +bool streamer_tree_cache_lookup (struct streamer_tree_cache_d *, tree, + unsigned *); +struct streamer_tree_cache_d *streamer_tree_cache_create (bool, bool, bool); +void streamer_tree_cache_delete (struct streamer_tree_cache_d *); + +/* Return the tree node at slot IX in CACHE. */ + +inline tree +streamer_tree_cache_get_tree (struct streamer_tree_cache_d *cache, unsigned ix) +{ + return cache->nodes[ix]; +} + +/* Return the tree hash value at slot IX in CACHE. */ + +inline hashval_t +streamer_tree_cache_get_hash (struct streamer_tree_cache_d *cache, unsigned ix) +{ + return cache->hashes[ix]; +} + +inline void +bp_pack_machine_mode (struct bitpack_d *bp, machine_mode mode) +{ + streamer_mode_table[mode] = 1; + bp_pack_enum (bp, machine_mode, 1 << 8, mode); +} + +inline machine_mode +bp_unpack_machine_mode (struct bitpack_d *bp) +{ + return (machine_mode) + ((class lto_input_block *) + bp->stream)->mode_table[bp_unpack_enum (bp, machine_mode, 1 << 8)]; +} + +#endif /* GCC_TREE_STREAMER_H */ |