Home
last modified time | relevance | path

Searched refs:get_uid (Results 1 – 21 of 21) sorted by relevance

/netbsd-src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/tests/
H A Dsanitizer_thread_registry_test.cc48 static uptr get_uid(u32 tid) { in get_uid() function
69 EXPECT_EQ(0U, registry->CreateThread(get_uid(0), true, -1, 0)); in TestRegistry()
73 EXPECT_EQ(i, registry->CreateThread(get_uid(i), is_detached(i), 0, 0)); in TestRegistry()
93 registry->CreateThread(get_uid(i), is_detached(i), 0, 0)); in TestRegistry()
104 EXPECT_EQ(0U, registry->FindThread(HasUid, (void*)get_uid(0))); in TestRegistry()
105 EXPECT_EQ(10U, registry->FindThread(HasUid, (void*)get_uid(10))); in TestRegistry()
135 HasUid, (void*)get_uid(0))); in TestRegistry()
/netbsd-src/external/gpl3/gcc.old/dist/gcc/analyzer/
H A Danalysis-plan.cc72 gcc_assert (m_cgraph_node_postorder[i]->get_uid () in analysis_plan()
74 m_index_by_uid[m_cgraph_node_postorder[i]->get_uid ()] = i; in analysis_plan()
95 int idx_a = m_index_by_uid[node_a->get_uid ()]; in cmp_function()
96 int idx_b = m_index_by_uid[node_b->get_uid ()]; in cmp_function()
/netbsd-src/external/gpl3/gcc/dist/gcc/analyzer/
H A Danalysis-plan.cc73 gcc_assert (m_cgraph_node_postorder[i]->get_uid () in analysis_plan()
75 m_index_by_uid[m_cgraph_node_postorder[i]->get_uid ()] = i; in analysis_plan()
96 int idx_a = m_index_by_uid[node_a->get_uid ()]; in cmp_function()
97 int idx_b = m_index_by_uid[node_b->get_uid ()]; in cmp_function()
/netbsd-src/external/gpl3/gcc/dist/gcc/
H A Dsymbol-summary.h202 T **v = &m_map.get_or_insert (node->get_uid (), &existed); in class()
212 T **v = m_map.get (node->get_uid ()); in class()
220 int uid = node->get_uid (); in class()
232 return m_map.get (node->get_uid ()) != NULL; in class()
291 gcc_checking_assert (node->get_uid ()); in symtab_insertion()
300 gcc_checking_assert (node->get_uid ()); in symtab_removal()
481 gcc_checking_assert (node->get_uid ());
490 gcc_checking_assert (node->get_uid ());
701 T **v = &m_map.get_or_insert (edge->get_uid (), &existed);
711 T **v = m_map.get (edge->get_uid ());
[all …]
H A Dipa-utils.cc88 splay_tree_remove (env->nodes_marked_new, v->get_uid ()); in searchc()
194 (splay_tree_key)node->get_uid (), in ipa_reduced_postorder()
H A Dipa-inline.cc1499 if (!bitmap_set_bit (updated_nodes, node->get_uid ())) in update_caller_keys()
1565 (&avail, e->caller)->get_uid ())) in update_callee_keys()
1577 && !bitmap_bit_p (updated_nodes, callee->get_uid ())) in update_callee_keys()
H A Dsymtab.cc1405 unsigned int uid = e->caller->get_uid (); in is_caller_ifunc_resolver()
1447 unsigned int uid = cnode->get_uid (); in check_ifunc_callee_symtab_nodes()
H A Dcgraph.h1306 inline int get_uid () in get_uid() function
1875 inline int get_uid () in get_uid() function
H A Dcgraph.cc128 int uid = ptr->this_node->get_uid (); in hash()
137 return n1->this_node->get_uid () == n2->this_node->get_uid (); in equal()
H A Dpasses.cc1257 cgraph_uid = func ? cgraph_node::get (func)->get_uid () : 0; in is_pass_explicitly_enabled_or_disabled()
H A Dlto-cgraph.cc1302 "node with uid %d", node->get_uid ()); in input_node()
H A Dtree-pretty-print.cc4586 fprintf (dump_file, ", cgraph_uid=%d", node->get_uid ()); in dump_function_header()
H A DChangeLog-201820247 cgraph_node::get_uid ().
20249 * cgraph.h (cgraph_node::get_uid): New method.
20251 cgraph_node::get_uid ().
/netbsd-src/external/gpl3/gcc.old/dist/gcc/
H A Dsymbol-summary.h153 T **v = &m_map.get_or_insert (node->get_uid (), &existed); in class()
163 T **v = m_map.get (node->get_uid ()); in class()
171 int uid = node->get_uid (); in class()
183 return m_map.get (node->get_uid ()) != NULL; in class()
250 gcc_checking_assert (node->get_uid ()); in symtab_insertion()
261 gcc_checking_assert (node->get_uid ()); in symtab_removal()
449 gcc_checking_assert (node->get_uid ());
460 gcc_checking_assert (node->get_uid ());
645 T **v = &m_map.get_or_insert (edge->get_uid (), &existed);
655 T **v = m_map.get (edge->get_uid ());
[all …]
H A Dipa-utils.c88 splay_tree_remove (env->nodes_marked_new, v->get_uid ()); in searchc()
194 (splay_tree_key)node->get_uid (), in ipa_reduced_postorder()
H A Dipa-inline.c1439 if (!bitmap_set_bit (updated_nodes, node->get_uid ())) in update_caller_keys()
1505 (&avail, e->caller)->get_uid ())) in update_callee_keys()
1517 && !bitmap_bit_p (updated_nodes, callee->get_uid ())) in update_callee_keys()
H A Dcgraph.h1350 inline int get_uid () in get_uid() function
1912 inline int get_uid () in get_uid() function
H A Dcgraph.c125 int uid = ptr->this_node->get_uid (); in hash()
134 return n1->this_node->get_uid () == n2->this_node->get_uid (); in equal()
H A Dpasses.c1210 cgraph_uid = func ? cgraph_node::get (func)->get_uid () : 0; in is_pass_explicitly_enabled_or_disabled()
H A Dlto-cgraph.c1289 "node with uid %d", node->get_uid ()); in input_node()
H A Dtree-pretty-print.c4367 fprintf (dump_file, ", cgraph_uid=%d", node->get_uid ()); in dump_function_header()