Home
last modified time | relevance | path

Searched refs:m_map (Results 1 – 25 of 35) sorted by relevance

12

/netbsd-src/external/gpl3/gcc/dist/gcc/analyzer/
H A Dstore.cc528 : m_map (other.m_map) in binding_map()
538 gcc_assert (m_map.elements () == 0); in operator =()
539 for (map_t::iterator iter = other.m_map.begin (); iter != other.m_map.end (); in operator =()
544 m_map.put (key, sval); in operator =()
554 if (m_map.elements () != other.m_map.elements ()) in operator ==()
557 for (map_t::iterator iter = m_map.begin (); iter != m_map.end (); ++iter) in operator ==()
562 = const_cast <map_t &> (other.m_map).get (key); in operator ==()
578 for (map_t::iterator iter = m_map.begin (); iter != m_map.end (); ++iter) in hash()
600 for (map_t::iterator iter = m_map.begin (); in dump_to_pp()
601 iter != m_map.end (); ++iter) in dump_to_pp()
[all …]
H A Dstore.h467 binding_map () : m_map () {}
481 const svalue **slot = const_cast<map_t &> (m_map).get (key);
490 return m_map.put (k, v);
493 void remove (const binding_key *k) { m_map.remove (k); }
494 void empty () { m_map.empty (); }
496 iterator_t begin () const { return m_map.begin (); }
497 iterator_t end () const { return m_map.end (); }
498 size_t elements () const { return m_map.elements (); }
526 map_t m_map;
548 : m_base_region (base_region), m_map (),
[all …]
H A Dprogram-state.cc179 : m_sm (sm), m_map (), m_global_state (sm.get_start_state ()) in sm_state_map()
213 auto_vec <const svalue *> keys (m_map.elements ()); in print()
214 for (map_t::iterator iter = m_map.begin (); in print()
215 iter != m_map.end (); in print()
235 entry_t e = *const_cast <map_t &> (m_map).get (sval); in print()
295 for (map_t::iterator iter = m_map.begin (); in to_json()
296 iter != m_map.end (); in to_json()
317 return m_map.elements () == 0 && m_global_state == m_sm.get_start_state (); in is_empty_p()
330 for (map_t::iterator iter = m_map.begin (); in hash()
331 iter != m_map.end (); in hash()
[all …]
H A Dstate-purge.cc101 m_map (map), in gimple_op_visitor()
177 return m_map->get_or_create_data_for_decl (m_fun, decl); in get_or_create_data_for_decl()
180 state_purge_map *m_map; member in gimple_op_visitor
1075 if (m_map == NULL) in add_node_annotations()
1154 if (m_map == NULL) in add_stmt_annotations()
1164 const supernode *supernode = m_map->get_sg ().get_supernode_for_stmt (stmt); in add_stmt_annotations()
1183 for (state_purge_map::ssa_iterator iter = m_map->begin_ssas (); in print_needed()
1184 iter != m_map->end_ssas (); in print_needed()
1197 for (state_purge_map::decl_iterator iter = m_map->begin_decls (); in print_needed()
1198 iter != m_map->end_decls (); in print_needed()
H A Dprogram-state.h165 iterator_t begin () const { return m_map.begin (); } in begin()
166 iterator_t end () const { return m_map.end (); } in end()
167 size_t elements () const { return m_map.elements (); } in elements()
176 map_t m_map; variable
H A Ddiagnostic-manager.cc1176 for (map_t::iterator iter = m_map.begin (); in ~dedupe_winners()
1177 iter != m_map.end (); in ~dedupe_winners()
1195 if (saved_diagnostic **slot = m_map.get (key)) in add()
1230 m_map.put (key, sd); in add()
1247 for (auto outer : m_map) in handle_interactions()
1250 for (auto inner : m_map) in handle_interactions()
1265 m_map.remove (iter); in handle_interactions()
1276 auto_vec<const dedupe_key *> keys (m_map.elements ()); in emit_best()
1277 for (map_t::iterator iter = m_map.begin (); in emit_best()
1278 iter != m_map.end (); in emit_best()
[all …]
H A Dstate-purge.h236 state_purge_annotator (const state_purge_map *map) : m_map (map) {}
250 const state_purge_map *m_map;
H A Dengine.cc4727 for (map_t::iterator iter = m_map.begin (); in ~function_call_string_cluster()
4728 iter != m_map.end (); in ~function_call_string_cluster()
4747 auto_vec<supernode_cluster *> child_clusters (m_map.elements ()); in dump_dot()
4748 for (map_t::iterator iter = m_map.begin (); in dump_dot()
4749 iter != m_map.end (); in dump_dot()
4769 supernode_cluster **slot = m_map.get (supernode); in add_node()
4775 m_map.put (supernode, child); in add_node()
4799 map_t m_map; member in ana::function_call_string_cluster
4874 for (map_t::iterator iter = m_map.begin (); in ~root_cluster()
4875 iter != m_map.end (); in ~root_cluster()
[all …]
/netbsd-src/external/gpl3/gcc/dist/gcc/
H A Dordered-hash-map.h42 : m_map (other.m_map), in ordered_hash_map()
58 bool existed = m_map.put (k, v); in put()
76 return m_map.get (k); in get()
84 m_map.remove (k); in remove()
87 size_t elements () const { return m_map.elements (); } in elements()
172 hash_map<KeyId, Value, Traits> m_map; variable
H A Djson.cc53 for (map_t::iterator it = m_map.begin (); it != m_map.end (); ++it) in ~object()
67 for (map_t::iterator it = m_map.begin (); it != m_map.end (); ++it) in print()
69 if (it != m_map.begin ()) in print()
91 value **ptr = m_map.get (key); in set()
102 m_map.put (xstrdup (key), v); in set()
114 value **ptr = const_cast <map_t &> (m_map).get (key); in get()
H A Dsymbol-summary.h194 m_map.template traverse <f> (a); in class()
202 T **v = &m_map.get_or_insert (node->get_uid (), &existed); in class()
212 T **v = m_map.get (node->get_uid ()); in class()
221 T **v = m_map.get (uid); in class()
224 m_map.remove (uid); in class()
232 return m_map.get (node->get_uid ()) != NULL; in class()
259 hash_map <map_hash, T *> m_map; in class() local
274 m_ggc (ggc), m_map (13, ggc, true, GATHER_STATISTICS PASS_MEM_STAT) {} in function_summary()
283 for (map_iterator it = m_map.begin (); it != m_map.end (); ++it) in ~function_summary()
322 gt_ggc_mx (&summary->m_map); in gt_ggc_mx()
[all …]
H A Dmem-stats.h383 mem_map_t *m_map; variable
417 T **slot = m_map->get (location); in register_descriptor()
427 m_map->put (location, usage); in register_descriptor()
559 m_map = new mem_map_t (13, false, false, false); in mem_alloc_description()
570 for (typename mem_map_t::iterator it = m_map->begin (); it != m_map->end (); in ~mem_alloc_description()
577 delete m_map; in ~mem_alloc_description() local
595 mem_list_t *list = XCNEWVEC (mem_list_t, m_map->elements ()); in get_list()
598 for (typename mem_map_t::iterator it = m_map->begin (); it != m_map->end (); in get_list()
/netbsd-src/external/gpl3/gcc.old/dist/gcc/
H A Dordered-hash-map.h42 : m_map (other.m_map), in ordered_hash_map()
58 bool existed = m_map.put (k, v); in put()
76 return m_map.get (k); in get()
84 m_map.remove (k); in remove()
87 size_t elements () const { return m_map.elements (); } in elements()
172 hash_map<KeyId, Value, Traits> m_map; variable
H A Djson.cc53 for (map_t::iterator it = m_map.begin (); it != m_map.end (); ++it) in ~object()
67 for (map_t::iterator it = m_map.begin (); it != m_map.end (); ++it) in print()
69 if (it != m_map.begin ()) in print()
88 value **ptr = m_map.get (key); in set()
99 m_map.put (xstrdup (key), v); in set()
111 value **ptr = const_cast <map_t &> (m_map).get (key); in get()
H A Dsymbol-summary.h145 m_map.template traverse <f> (a); in class()
153 T **v = &m_map.get_or_insert (node->get_uid (), &existed); in class()
163 T **v = m_map.get (node->get_uid ()); in class()
172 T **v = m_map.get (uid); in class()
175 m_map.remove (uid); in class()
183 return m_map.get (node->get_uid ()) != NULL; in class()
210 hash_map <map_hash, T *> m_map; in class() local
222 m_map (13, ggc, true, GATHER_STATISTICS PASS_MEM_STAT) in function_summary()
242 for (map_iterator it = m_map.begin (); it != m_map.end (); ++it) in ~function_summary()
283 gt_ggc_mx (&summary->m_map); in gt_ggc_mx()
[all …]
H A Dmem-stats.h383 mem_map_t *m_map; variable
417 T **slot = m_map->get (location); in register_descriptor()
427 m_map->put (location, usage); in register_descriptor()
559 m_map = new mem_map_t (13, false, false, false); in mem_alloc_description()
570 for (typename mem_map_t::iterator it = m_map->begin (); it != m_map->end (); in ~mem_alloc_description()
577 delete m_map; in ~mem_alloc_description() local
595 mem_list_t *list = XCNEWVEC (mem_list_t, m_map->elements ()); in get_list()
598 for (typename mem_map_t::iterator it = m_map->begin (); it != m_map->end (); in get_list()
/netbsd-src/external/bsd/atf/dist/atf-c/detail/
H A Dmap.c112 return i1.m_map == i2.m_map && i1.m_entry == i2.m_entry; in atf_equal_map_citer_map_citer()
156 return i1.m_map == i2.m_map && i1.m_entry == i2.m_entry; in atf_equal_map_iter_map_iter()
229 iter.m_map = m; in atf_map_begin()
239 citer.m_map = m; in atf_map_begin_c()
249 iter.m_map = m; in atf_map_end()
259 iter.m_map = m; in atf_map_end_c()
275 i.m_map = m; in atf_map_find()
295 i.m_map = m; in atf_map_find_c()
H A Dmap.h45 const struct atf_map *m_map; member
65 struct atf_map *m_map; member
/netbsd-src/external/gpl3/gcc.old/dist/gcc/analyzer/
H A Dstate-purge.h94 = const_cast <map_t&> (m_map).get (name);
100 iterator begin () const { return m_map.begin (); }
101 iterator end () const { return m_map.end (); }
107 map_t m_map;
152 state_purge_annotator (const state_purge_map *map) : m_map (map) {}
162 const state_purge_map *m_map;
H A Dprogram-state.cc107 : m_map (), m_global_state (0) in sm_state_map()
130 for (map_t::iterator iter = m_map.begin (); in clone_with_remapping()
131 iter != m_map.end (); in clone_with_remapping()
147 result->m_map.put (new_sid, e); in clone_with_remapping()
167 for (map_t::iterator iter = m_map.begin (); in print()
168 iter != m_map.end (); in print()
222 return m_map.elements () == 0 && m_global_state == 0; in is_empty_p()
235 for (map_t::iterator iter = m_map.begin (); in hash()
236 iter != m_map.end (); in hash()
259 if (m_map.elements () != other.m_map.elements ()) in operator ==()
[all …]
H A Dstate-purge.cc80 m_map.put (name, new state_purge_per_ssa_name (*this, name, fun)); in state_purge_map()
89 for (iterator iter = m_map.begin (); iter != m_map.end (); ++iter) in ~state_purge_map()
427 if (m_map == NULL) in add_node_annotations()
444 for (state_purge_map::iterator iter = m_map->begin (); in add_node_annotations()
445 iter != m_map->end (); in add_node_annotations()
504 if (m_map == NULL) in add_stmt_annotations()
514 const supernode *supernode = m_map->get_sg ().get_supernode_for_stmt (stmt); in add_stmt_annotations()
521 for (state_purge_map::iterator iter = m_map->begin (); in add_stmt_annotations()
522 iter != m_map->end (); in add_stmt_annotations()
H A Dregion-model.cc1688 m_map (other.m_map) in map_region()
1699 if (m_map.elements () != other.m_map.elements ()) in compare_fields()
1702 for (map_t::iterator iter = m_map.begin (); in compare_fields()
1703 iter != m_map.end (); in compare_fields()
1708 region_id *other_slot = const_cast <map_t &> (other.m_map).get (key); in compare_fields()
1726 for (map_t::iterator iter = m_map.begin (); in print_fields()
1727 iter != m_map.end (); in print_fields()
1730 if (iter != m_map.begin ()) in print_fields()
1747 for (map_t::iterator iter = m_map.begin (); in validate()
1748 iter != m_map.end (); in validate()
[all …]
H A Ddiagnostic-manager.cc335 for (map_t::iterator iter = m_map.begin (); in ~dedupe_winners()
336 iter != m_map.end (); in ~dedupe_winners()
391 if (dedupe_candidate **slot = m_map.get (key)) in add()
425 m_map.put (key, dc); in add()
439 auto_vec<const dedupe_key *> keys (m_map.elements ()); in emit_best()
440 for (map_t::iterator iter = m_map.begin (); in emit_best()
441 iter != m_map.end (); in emit_best()
455 dedupe_candidate **slot = m_map.get (key); in emit_best()
471 map_t m_map; member in ana::dedupe_winners
H A Dprogram-state.h204 iterator_t begin () const { return m_map.begin (); }
205 iterator_t end () const { return m_map.end (); }
208 map_t m_map;
H A Dengine.cc3069 for (map_t::iterator iter = m_map.begin (); in ~function_call_string_cluster()
3070 iter != m_map.end (); in ~function_call_string_cluster()
3087 for (map_t::iterator iter = m_map.begin (); in dump_dot()
3088 iter != m_map.end (); in dump_dot()
3101 supernode_cluster **slot = m_map.get (supernode); in add_node()
3107 m_map.put (supernode, child); in add_node()
3116 map_t m_map; member in ana::function_call_string_cluster
3191 for (map_t::iterator iter = m_map.begin (); in ~root_cluster()
3192 iter != m_map.end (); in ~root_cluster()
3204 for (map_t::iterator iter = m_map.begin (); in dump_dot()
[all …]

12