Home
last modified time | relevance | path

Searched refs:dest_node (Results 1 – 6 of 6) sorted by relevance

/netbsd-src/external/gpl3/gcc.old/dist/gcc/
H A Dddg.c171 ddg_node_ptr dest_node, dep_t link) in create_ddg_dep_from_intra_loop_link() argument
177 && mem_access_insn_p (dest_node->insn) ? MEM_DEP in create_ddg_dep_from_intra_loop_link()
179 gcc_assert (src_node->cuid < dest_node->cuid); in create_ddg_dep_from_intra_loop_link()
200 && !def_has_ccmode_p (dest_node->insn) in create_ddg_dep_from_intra_loop_link()
201 && !autoinc_var_is_used_p (dest_node->insn, src_node->insn)) in create_ddg_dep_from_intra_loop_link()
205 set = single_set (dest_node->insn); in create_ddg_dep_from_intra_loop_link()
223 e = create_ddg_edge (src_node, dest_node, t, dt, latency, distance); in create_ddg_dep_from_intra_loop_link()
459 ddg_node_ptr dest_node = &g->nodes[i]; in build_intra_loop_deps() local
463 FOR_EACH_DEP (dest_node->insn, SD_LIST_BACK, sd_it, dep) in build_intra_loop_deps()
471 create_ddg_dep_from_intra_loop_link (g, src_node, dest_node, dep); in build_intra_loop_deps()
[all …]
H A Dipa-utils.c765 struct cgraph_node *dest_node = cgraph_node::get_create (dest); in recursive_call_p() local
771 if (cnode != dest_node->ultimate_alias_target (&avail)) in recursive_call_p()
775 if (!dest_node->semantically_equivalent_p (cnode)) in recursive_call_p()
780 if (!dest_node->semantically_equivalent_p (alias->referring)) in recursive_call_p()
/netbsd-src/external/gpl3/gcc/dist/gcc/
H A Dddg.cc171 ddg_node_ptr dest_node, dep_t link) in create_ddg_dep_from_intra_loop_link() argument
177 && mem_access_insn_p (dest_node->insn) ? MEM_DEP in create_ddg_dep_from_intra_loop_link()
179 gcc_assert (src_node->cuid < dest_node->cuid); in create_ddg_dep_from_intra_loop_link()
200 && !def_has_ccmode_p (dest_node->insn) in create_ddg_dep_from_intra_loop_link()
201 && !autoinc_var_is_used_p (dest_node->insn, src_node->insn)) in create_ddg_dep_from_intra_loop_link()
205 set = single_set (dest_node->insn); in create_ddg_dep_from_intra_loop_link()
223 e = create_ddg_edge (src_node, dest_node, t, dt, latency, distance); in create_ddg_dep_from_intra_loop_link()
459 ddg_node_ptr dest_node = &g->nodes[i]; in build_intra_loop_deps() local
463 FOR_EACH_DEP (dest_node->insn, SD_LIST_BACK, sd_it, dep) in build_intra_loop_deps()
471 create_ddg_dep_from_intra_loop_link (g, src_node, dest_node, dep); in build_intra_loop_deps()
[all …]
H A Dipa-utils.cc765 struct cgraph_node *dest_node = cgraph_node::get_create (dest); in recursive_call_p() local
771 if (cnode != dest_node->ultimate_alias_target (&avail)) in recursive_call_p()
775 if (!dest_node->semantically_equivalent_p (cnode)) in recursive_call_p()
780 if (!dest_node->semantically_equivalent_p (alias->referring)) in recursive_call_p()
/netbsd-src/external/gpl2/xcvs/dist/lib/
H A Dregexec.c71 Idx str_idx, Idx dest_node, Idx nregs,
1250 Idx dest_node; in proceed_next_node() local
1256 for (dest_node = REG_MISSING, i = 0; i < edests->nelem; ++i) in proceed_next_node()
1261 if (dest_node == REG_MISSING) in proceed_next_node()
1262 dest_node = candidate; in proceed_next_node()
1268 if (re_node_set_contains (eps_via_nodes, dest_node)) in proceed_next_node()
1281 return dest_node; in proceed_next_node()
1312 Idx dest_node; in proceed_next_node() local
1316 dest_node = dfa->edests[node].elems[0]; in proceed_next_node()
1318 dest_node)) in proceed_next_node()
[all …]
/netbsd-src/external/gpl3/gcc/dist/gcc/analyzer/
H A Dengine.cc1835 const exploded_node *dest_node = eedge.m_dest; in add_events_to_path() local
1836 const program_point &dest_point = dest_node->get_point (); in add_events_to_path()