| /src/external/gpl3/gcc/dist/gcc/analyzer/ |
| region-model-manager.h | 208 typedef hash_map<constant_svalue::key_t, constant_svalue *> constants_map_t;
211 typedef hash_map<tree, unknown_svalue *> unknowns_map_t;
215 typedef hash_map<poisoned_svalue::key_t,
219 typedef hash_map<setjmp_svalue::key_t,
223 typedef hash_map<const region *, initial_svalue *> initial_values_map_t;
226 typedef hash_map<region_svalue::key_t, region_svalue *> pointer_values_map_t;
229 typedef hash_map<unaryop_svalue::key_t,
233 typedef hash_map<binop_svalue::key_t, binop_svalue *> binop_values_map_t;
236 typedef hash_map<sub_svalue::key_t, sub_svalue *> sub_values_map_t;
239 typedef hash_map<repeated_svalue::key_t
[all...] |
| known-function-manager.h | 65 hash_map<tree, known_function *> m_map_id_to_kf;
68 hash_map<tree, known_function *> m_std_ns_map_id_to_kf;
|
| analyzer-language.cc | 33 static GTY (()) hash_map <tree, tree> *analyzer_stashed_constants;
70 analyzer_stashed_constants = hash_map<tree, tree>::create_ggc ();
|
| call-summary.h | 109 typedef hash_map <const svalue *, const svalue *> svalue_map_t;
113 typedef hash_map <const region *, const region *> region_map_t;
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| hash-map.h | 24 /* Class hash_map is a hash-value based container mapping objects of
31 by invoking their dtor. On hash_map destruction all elements are
32 removed. Objects of hash_map type are copy-constructible but not
39 class GTY((user)) hash_map
138 explicit hash_map (size_t n = default_hash_map_size, bool ggc = false, function
147 explicit hash_map (const hash_map &h, bool ggc = false, function
154 /* Create a hash_map in ggc memory. */
155 static hash_map *create_ggc (size_t size = default_hash_map_size,
159 hash_map *map = ggc_alloc<hash_map> ()
[all...] |
| tree-affine.h | 82 void aff_combination_expand (aff_tree *, hash_map<tree, name_expansion *> **);
84 hash_map<tree, name_expansion *> **);
86 void free_affine_expand_cache (hash_map<tree, name_expansion *> **);
|
| gimple-range-edge.h | 49 hash_map<edge, irange *> *m_edge_table;
|
| tree-inline.h | 68 hash_map<tree, tree> *decl_map;
88 hash_map<void *, void *> *eh_map;
153 hash_map<tree, tree> *debug_map;
157 hash_map<dependence_hash, unsigned short> *dependence_map;
|
| ipa-icf.h | 171 typedef hash_map<sem_usage_hash, auto_vec<sem_item *> > ref_map;
201 hash_map <symtab_node *, sem_item *> &ignored_nodes) = 0;
205 hash_map <symtab_node *, sem_item *> &ignored_nodes) = 0;
221 void update_hash_by_addr_refs (hash_map <symtab_node *,
226 void update_hash_by_local_refs (hash_map <symtab_node *,
288 bool compare_symbol_references (hash_map <symtab_node *, sem_item *>
305 static hash_map<const_tree, hashval_t> m_type_hash_cache;
322 hash_map <symtab_node *, sem_item *> &ignored_nodes);
325 hash_map <symtab_node *, sem_item *> &ignored_nodes);
435 hash_map <symtab_node *, sem_item *> &ignored_nodes)
[all...] |
| except.h | 204 hash_map<gimple *, int> *GTY(()) throw_stmt_table;
248 extern hash_map<void *, void *> *duplicate_eh_regions
291 extern hash_map<gimple *, int> *get_eh_throw_stmt_table (struct function *);
292 extern void set_eh_throw_stmt_table (function *, hash_map<gimple *, int> *);
|
| profile.h | 43 extern hash_map<edge,gcov_type> *edge_gcov_counts;
|
| tree-eh.h | 51 hash_map<void *, void *> *, int);
|
| print-rtl.h | 157 hash_map<const_rtx, int> m_rtx_occurrence_count;
158 hash_map<const_rtx, int> m_rtx_reuse_ids;
|
| ipa-icf-gimple.h | 268 hash_map <edge, edge> m_edge_map;
271 hash_map <const_tree, const_tree> m_decl_map;
274 hash_map <const_tree, int> m_label_bb_map;
|
| ipa-param-manipulation.h | 364 hash_map<tree, tree> m_dead_ssa_debug_equiv;
367 hash_map<gimple *, tree> m_dead_stmt_debug_equiv;
422 hash_map<tree, unsigned> m_removed_map;
|
| /src/external/gpl3/gcc/dist/gcc/ |
| hash-map.h | 24 /* Class hash_map is a hash-value based container mapping objects of
31 by invoking their dtor. On hash_map destruction all elements are
32 removed. Objects of hash_map type are copy-constructible but not
39 class GTY((user)) hash_map
138 explicit hash_map (size_t n = default_hash_map_size, bool ggc = false, function
147 explicit hash_map (const hash_map &h, bool ggc = false, function
154 /* Create a hash_map in ggc memory. */
155 static hash_map *create_ggc (size_t size = default_hash_map_size,
159 hash_map *map = ggc_alloc<hash_map> ()
[all...] |
| tree-affine.h | 82 void aff_combination_expand (aff_tree *, hash_map<tree, name_expansion *> **);
84 hash_map<tree, name_expansion *> **);
86 void free_affine_expand_cache (hash_map<tree, name_expansion *> **);
|
| gimple-range-edge.h | 49 hash_map<edge, vrange_storage *> *m_edge_table;
|
| tree-inline.h | 68 hash_map<tree, tree> *decl_map;
88 hash_map<void *, void *> *eh_map;
153 hash_map<tree, tree> *debug_map;
157 hash_map<dependence_hash, unsigned short> *dependence_map;
|
| ipa-icf.h | 171 typedef hash_map<sem_usage_hash, auto_vec<sem_item *> > ref_map;
201 hash_map <symtab_node *, sem_item *> &ignored_nodes) = 0;
205 hash_map <symtab_node *, sem_item *> &ignored_nodes) = 0;
221 void update_hash_by_addr_refs (hash_map <symtab_node *,
226 void update_hash_by_local_refs (hash_map <symtab_node *,
288 bool compare_symbol_references (hash_map <symtab_node *, sem_item *>
305 static hash_map<const_tree, hashval_t> m_type_hash_cache;
322 hash_map <symtab_node *, sem_item *> &ignored_nodes)
326 hash_map <symtab_node *, sem_item *> &ignored_nodes)
437 hash_map <symtab_node *, sem_item *> &ignored_nodes
[all...] |
| except.h | 204 hash_map<gimple *, int> *GTY(()) throw_stmt_table;
248 extern hash_map<void *, void *> *duplicate_eh_regions
291 extern hash_map<gimple *, int> *get_eh_throw_stmt_table (struct function *);
292 extern void set_eh_throw_stmt_table (function *, hash_map<gimple *, int> *);
|
| profile.h | 43 extern hash_map<edge,gcov_type> *edge_gcov_counts;
|
| tree-eh.h | 51 hash_map<void *, void *> *, int);
|
| print-rtl.h | 157 hash_map<const_rtx, int> m_rtx_occurrence_count;
158 hash_map<const_rtx, int> m_rtx_reuse_ids;
|
| /src/external/gpl3/gcc/dist/gcc/config/riscv/ |
| riscv-vector-costs.cc | 127 get_live_range (hash_map<tree, pair> *live_ranges, tree arg)
184 hash_map<basic_block, vec<stmt_point>> &program_points_per_bb)
336 const hash_map<basic_block, vec<stmt_point>> &program_points_per_bb,
337 hash_map<basic_block, hash_map<tree, pair>> &live_ranges_per_bb)
345 for (hash_map<basic_block, vec<stmt_point>>::iterator iter
352 hash_map<tree, pair> *live_ranges
429 for (hash_map<tree, pair>::iterator iter = live_ranges->begin ();
475 const hash_map<tree, pair> &live_ranges,
484 for (hash_map<tree, pair>::iterator iter = live_ranges.begin ()
[all...] |
