| /src/external/gpl3/gcc/dist/gcc/ |
| hash-set.h | 24 /* Class hash_set is a hash-value based container for objects of
31 On hash_set destruction all elements are removed. Objects of
32 hash_set type are copy-constructible but not assignable. */
36 class hash_set class
40 explicit hash_set (size_t n = 13, bool ggc = false CXX_MEM_STAT_INFO) function in class:hash_set
43 /* Create a hash_set in gc memory with space for at least n elements. */
45 static hash_set *
48 hash_set *set = ggc_alloc<hash_set> ();
49 new (set) hash_set (n, true)
[all...] |
| gimple-predicate-analysis.h | 101 hash_set<tree> *);
153 hash_set<gphi *> *);
155 hash_set<gphi *> *, bitmap *);
156 bool overlap (gphi *, unsigned, hash_set<gphi *> *, const predicate &);
159 hash_set<gimple *> *);
|
| hash-set-tests.cc | 32 /* Construct a hash_set <const char *> and verify that various operations
38 hash_set <const char *> s;
47 for (hash_set<const char *>::iterator it = s.begin (); it != s.end (); ++it)
50 /* Populate the hash_set. */
76 for (hash_set<const char *>::iterator it = s.begin (); it != s.end (); ++it)
86 hash_set <const char *, true> t;
91 for (hash_set<const char *, true>::iterator it = t.begin ();
95 /* Populate the hash_set. */
108 for (hash_set<const char *, true>::iterator it = t.begin ();
228 typedef hash_set <val_t, false, value_hash_traits> Set
[all...] |
| gimple-walk.h | 40 hash_set<tree> *pset;
|
| ipa-param-manipulation.h | 228 hash_set <tree> *killed_ssas);
359 hash_set<gimple *> m_dead_stmts;
360 hash_set<tree> m_dead_ssas;
446 void ipa_release_ssas_in_hash (hash_set <tree> *killed_ssas);
|
| ipa-icf-gimple.h | 144 hash_set<symtab_node *> *ignored_source_nodes = NULL,
145 hash_set<symtab_node *> *ignored_target_nodes = NULL);
207 typedef hash_set<tree> operand_access_type_map;
266 hash_set<symtab_node *> *m_ignored_source_nodes;
270 hash_set<symtab_node *> *m_ignored_target_nodes;
|
| tree-inline.h | 137 hash_set<gimple *> *statements_to_fold;
180 hash_set <tree> *killed_new_ssa_names;
|
| cfgrtl.h | 60 extern void find_bbs_reachable_by_hot_paths (hash_set <basic_block> *);
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| hash-set.h | 24 /* Class hash_set is a hash-value based container for objects of
31 On hash_set destruction all elements are removed. Objects of
32 hash_set type are copy-constructible but not assignable. */
36 class hash_set class
40 explicit hash_set (size_t n = 13, bool ggc = false CXX_MEM_STAT_INFO) function in class:hash_set
43 /* Create a hash_set in gc memory with space for at least n elements. */
45 static hash_set *
48 hash_set *set = ggc_alloc<hash_set> ();
49 new (set) hash_set (n, true)
[all...] |
| gimple-predicate-analysis.h | 110 hash_set<gphi *> *);
124 bool overlap (gphi *, unsigned, hash_set<gphi *> *);
133 hash_set<tree> *);
|
| ipa-icf-gimple.h | 143 hash_set<symtab_node *> *ignored_source_nodes = NULL,
144 hash_set<symtab_node *> *ignored_target_nodes = NULL);
206 typedef hash_set<tree> operand_access_type_map;
261 hash_set<symtab_node *> *m_ignored_source_nodes;
265 hash_set<symtab_node *> *m_ignored_target_nodes;
|
| hash-set-tests.cc | 32 /* Construct a hash_set <const char *> and verify that various operations
38 hash_set <const char *> s;
47 for (hash_set<const char *>::iterator it = s.begin (); it != s.end (); ++it)
50 /* Populate the hash_set. */
76 for (hash_set<const char *>::iterator it = s.begin (); it != s.end (); ++it)
86 hash_set <const char *, true> t;
91 for (hash_set<const char *, true>::iterator it = t.begin ();
95 /* Populate the hash_set. */
108 for (hash_set<const char *, true>::iterator it = t.begin ();
228 typedef hash_set <val_t, false, value_hash_traits> Set
[all...] |
| gimple-walk.h | 40 hash_set<tree> *pset;
|
| ipa-param-manipulation.h | 228 hash_set <tree> *killed_ssas);
360 hash_set<gimple *> m_dead_stmts;
361 hash_set<tree> m_dead_ssas;
434 void ipa_release_ssas_in_hash (hash_set <tree> *killed_ssas);
|
| tree-inline.h | 137 hash_set<gimple *> *statements_to_fold;
180 hash_set <tree> *killed_new_ssa_names;
|
| cfgrtl.h | 60 extern void find_bbs_reachable_by_hot_paths (hash_set <basic_block> *);
|
| /src/external/gpl3/gcc/dist/gcc/lto/ |
| lto-partition.h | 29 hash_set<symtab_node *> *initializers_visited;
|
| /src/external/gpl3/gcc.old/dist/gcc/lto/ |
| lto-partition.h | 29 hash_set<symtab_node *> *initializers_visited;
|
| /src/external/gpl3/gcc/dist/gcc/analyzer/ |
| region-model-reachability.h | 67 hash_set<const region *>::iterator begin ()
71 hash_set<const region *>::iterator end ()
92 hash_set<const region *>::iterator begin_mutable_base_regs ()
96 hash_set<const region *>::iterator end_mutable_base_regs ()
110 hash_set<const region *> m_reachable_base_regs;
113 hash_set<const region *> m_mutable_base_regs;
|
| trimmed-graph.h | 98 hash_set <const exploded_edge *> & mut
99 = const_cast <hash_set <const exploded_edge *> &> (m_eedges);
108 hash_set <const exploded_node *> m_enodes;
110 hash_set <const exploded_edge *> m_eedges;
|
| analyzer.cc | 69 fixup_tree_for_diagnostic_1 (tree expr, hash_set<tree> *visited);
76 hash_set<tree> *visited)
126 hash_set<tree> *visited)
179 fixup_tree_for_diagnostic_1 (tree expr, hash_set<tree> *visited)
209 hash_set<tree> visited;
218 hash_set<tree> visited;
|
| /src/external/gpl3/gcc.old/dist/gcc/analyzer/ |
| region-model-reachability.h | 67 hash_set<const region *>::iterator begin ()
71 hash_set<const region *>::iterator end ()
92 hash_set<const region *>::iterator begin_mutable_base_regs ()
96 hash_set<const region *>::iterator end_mutable_base_regs ()
110 hash_set<const region *> m_reachable_base_regs;
113 hash_set<const region *> m_mutable_base_regs;
|
| trimmed-graph.h | 98 hash_set <const exploded_edge *> & mut
99 = const_cast <hash_set <const exploded_edge *> &> (m_eedges);
108 hash_set <const exploded_node *> m_enodes;
110 hash_set <const exploded_edge *> m_eedges;
|
| analyzer.cc | 64 fixup_tree_for_diagnostic_1 (tree expr, hash_set<tree> *visited);
71 hash_set<tree> *visited)
121 hash_set<tree> *visited)
174 fixup_tree_for_diagnostic_1 (tree expr, hash_set<tree> *visited)
204 hash_set<tree> visited;
213 hash_set<tree> visited;
|
| /src/external/gpl3/gcc/dist/gcc/config/riscv/ |
| riscv-vector-costs.h | 92 hash_set <tree_pair_hash> memrefs;
|
