| /dflybsd-src/contrib/gcc-8.0/gcc/ |
| H A D | hash-set.h | 25 class hash_set
29 explicit hash_set (size_t n = 13, bool ggc = false CXX_MEM_STAT_INFO)
34 static hash_set *
37 hash_set *set = ggc_alloc<hash_set> (); in create_ggc()
38 new (set) hash_set (n, true); in create_ggc()
123 template<typename T, typename U> friend void gt_ggc_mx (hash_set<T, U> *);
124 template<typename T, typename U> friend void gt_pch_nx (hash_set<T, U> *);
125 …template<typename T, typename U> friend void gt_pch_nx (hash_set<T, U> *, gt_pointer_operator, voi…
142 debug_helper (hash_set<T> &ref) in debug_helper()
144 for (typename hash_set<T>::iterator it = ref.begin (); in debug_helper()
[all …]
|
| H A D | ipa-icf-gimple.h | 142 hash_set<symtab_node *> *ignored_source_nodes = NULL,
143 hash_set<symtab_node *> *ignored_target_nodes = NULL);
256 hash_set<symtab_node *> *m_ignored_source_nodes;
260 hash_set<symtab_node *> *m_ignored_target_nodes;
|
| H A D | tree-ssa-uninit.c | 54 static hash_set<tree> *possibly_undefined_names = 0;
819 hash_set<gimple *> *visited_phis) in collect_phi_def_edges()
886 hash_set<gimple *> visited_phis; in find_def_preds()
1116 hash_set<gphi *> *visited_phis);
1154 hash_set<gphi *> *visited_phis, in prune_uninit_phi_opnds()
1328 hash_set<gphi *> *visited_phis) in use_pred_not_overlap_with_undef_path_pred()
1992 hash_set<tree> *mark_set) in push_to_worklist()
2079 hash_set<tree> *mark_set) in normalize_one_pred_1()
2199 hash_set<tree> mark_set; in normalize_one_pred()
2217 hash_set<tree> mark_set; in normalize_one_pred_chain()
[all …]
|
| H A D | asan.h | 45 extern hash_set <tree> *asan_used_labels;
113 extern hash_set<tree> *asan_handled_variables;
|
| H A D | ipa-devirt.c | 176 hash_set<type_pair> *,
183 static hash_set<cgraph_node *> *cached_polymorphic_call_targets;
202 hash_set<tree> * GTY((skip)) types_set;
663 hash_set<type_pair> *visited,
1253 hash_set<type_pair> *visited,
1657 hash_set<type_pair> visited;
1679 val->types_set = new hash_set<tree>;
1728 hash_set<type_pair> visited;
2332 tree target, hash_set<tree> *inserted,
2469 hash_set<tree> *inserted,
[all …]
|
| H A D | ipa.c | 91 hash_set<symtab_node *> *reachable) in enqueue_node()
110 hash_set<symtab_node *> *reachable) in process_references()
158 walk_polymorphic_call_targets (hash_set<void *> *reachable_call_targets, in walk_polymorphic_call_targets()
161 hash_set<symtab_node *> *reachable, in walk_polymorphic_call_targets()
312 hash_set<symtab_node *> reachable; in remove_unreachable_nodes()
313 hash_set<tree> body_needed_for_clonning; in remove_unreachable_nodes()
314 hash_set<void *> reachable_call_targets; in remove_unreachable_nodes()
|
| H A D | hash-set-tests.c | 38 hash_set <const char *> s; in test_set_of_strings()
|
| H A D | gimple-walk.h | 40 hash_set<tree> *pset;
|
| H A D | cfgrtl.h | 57 extern void find_bbs_reachable_by_hot_paths (hash_set <basic_block> *);
|
| H A D | ipa-pure-const.c | 185 static hash_set<tree> *
187 hash_set<tree> *warned_about, in suggest_attribute()
197 warned_about = new hash_set<tree>; in suggest_attribute()
221 static hash_set<tree> *warned_about; in warn_function_pure()
238 static hash_set<tree> *warned_about; in warn_function_const()
249 static hash_set<tree> *warned_about; in warn_function_malloc()
266 static hash_set<tree> *warned_about; in warn_function_noreturn()
283 static hash_set<tree> *warned_about; in warn_function_cold()
|
| H A D | tree-ssa-phiopt.c | 61 hash_set<tree> *);
63 static hash_set<tree> * get_non_trapping ();
165 hash_set<tree> *nontrap = 0; in tree_ssa_phiopt_worker()
1714 nontrapping_dom_walker (cdi_direction direction, hash_set<tree> *ps) in nontrapping_dom_walker()
1729 hash_set<tree> *m_nontrapping;
1849 static hash_set<tree> *
1853 hash_set<tree> *nontrap = new hash_set<tree>; in get_non_trapping()
1882 edge e0, edge e1, hash_set<tree> *nontrap) in cond_store_replacement()
|
| H A D | tree-ssa-threadbackward.c | 61 hash_set<basic_block> m_visited_bbs;
99 hash_set<basic_block> &local_visited_bbs, in fsm_find_thread_path()
499 hash_set<basic_block> local_visited_bbs; in check_subpath_and_update_thread_path()
|
| H A D | ipa-icf.h | 238 hash_set <symtab_node *> refs_set;
621 hash_set <symtab_node *> m_removed_items_set;
|
| H A D | tree-inline.h | 126 hash_set<gimple *> *statements_to_fold;
|
| H A D | gencfn-macros.c | 72 typedef hash_set <nofree_string_hash> string_set;
|
| H A D | hsa-common.c | 84 hash_set <tree> *hsa_failed_functions = NULL;
110 hsa_failed_functions = new hash_set <tree> (); in hsa_init_compilation_unit_data()
|
| H A D | ipa-inline.c | 2196 hash_set<cgraph_node *> *callers) in inline_to_all_callers_1()
2254 hash_set<cgraph_node *> callers; in inline_to_all_callers()
2259 for (hash_set<cgraph_node *>::iterator i = callers.begin (); in inline_to_all_callers()
2404 hash_set<struct cgraph_node *> *removed in flatten_remove_node_hook()
2405 = (hash_set<struct cgraph_node *> *) data; in flatten_remove_node_hook()
2466 hash_set<struct cgraph_node *> *flatten_removed_nodes = NULL; in ipa_inline()
2469 flatten_removed_nodes = new hash_set<struct cgraph_node *>; in ipa_inline()
|
| H A D | tree-ssa-loop-im.c | 1763 edge preheader, hash_set <basic_block> *flag_bbs) in execute_sm_if_changed()
1791 for (hash_set<basic_block>::iterator it = flag_bbs->begin (); in execute_sm_if_changed()
1922 sm_set_flag_if_changed (tree flag_, hash_set <basic_block> *bbs_) in sm_set_flag_if_changed()
1926 hash_set <basic_block> *bbs;
1949 hash_set <basic_block> *bbs) in execute_sm_if_changed_flag_set()
1974 hash_set<basic_block> flag_bbs; in execute_sm()
|
| /dflybsd-src/contrib/gcc-8.0/libstdc++-v3/include/backward/ |
| H A D | hash_set | 51 /** @file backward/hash_set
84 class hash_set
126 hash_set()
130 hash_set(size_type __n)
133 hash_set(size_type __n, const hasher& __hf)
136 hash_set(size_type __n, const hasher& __hf, const key_equal& __eql,
141 hash_set(_InputIterator __f, _InputIterator __l)
146 hash_set(_InputIterator __f, _InputIterator __l, size_type __n)
151 hash_set(_InputIterator __f, _InputIterator __l, size_type __n,
157 hash_set(_InputIterator __f, _InputIterator __l, size_type __n,
[all …]
|
| /dflybsd-src/contrib/gcc-4.7/libstdc++-v3/include/backward/ |
| H A D | hash_set | 52 /** @file backward/hash_set
85 class hash_set
127 hash_set()
131 hash_set(size_type __n)
134 hash_set(size_type __n, const hasher& __hf)
137 hash_set(size_type __n, const hasher& __hf, const key_equal& __eql,
142 hash_set(_InputIterator __f, _InputIterator __l)
147 hash_set(_InputIterator __f, _InputIterator __l, size_type __n)
152 hash_set(_InputIterator __f, _InputIterator __l, size_type __n,
158 hash_set(_InputIterator __f, _InputIterator __l, size_type __n,
[all …]
|
| /dflybsd-src/contrib/gcc-8.0/gcc/c-family/ |
| H A D | c-gimplify.c | 67 hash_set<tree> *pset = (hash_set<tree> *) data; in ubsan_walk_array_refs_r()
122 hash_set<tree> pset; in c_genericize()
|
| /dflybsd-src/contrib/gcc-8.0/gcc/lto/ |
| H A D | lto-partition.h | 29 hash_set<symtab_node *> *initializers_visited;
|
| /dflybsd-src/contrib/gcc-8.0/gcc/cp/ |
| H A D | cp-ubsan.c | 142 hash_set<tree> *pset;
246 hash_set<tree> pset; in cp_ubsan_instrument_member_accesses()
|
| /dflybsd-src/contrib/binutils-2.27/gold/ |
| H A D | system.h | 109 #define Unordered_set __gnu_cxx::hash_set
|
| /dflybsd-src/contrib/binutils-2.34/gold/ |
| H A D | system.h | 115 #define Unordered_set __gnu_cxx::hash_set
|