Searched refs:src_node (Results 1 - 5 of 5) sorted by relevance

/haiku-buildtools/gcc/gcc/
H A Dddg.c211 create_ddg_dep_from_intra_loop_link (ddg_ptr g, ddg_node_ptr src_node,
217 dep_data_type dt = (mem_access_insn_p (src_node->insn)
220 gcc_assert (src_node->cuid < dest_node->cuid);
230 gcc_assert (!DEBUG_INSN_P (src_node->insn) || t == ANTI_DEP);
245 && !autoinc_var_is_used_p (dest_node->insn, src_node->insn))
267 e = create_ddg_edge (src_node, dest_node, t, dt, latency, distance);
541 ddg_node_ptr src_node;
548 src_node = get_node_of_insn (g, src_insn);
550 if (!src_node)
553 create_ddg_dep_from_intra_loop_link (g, src_node, dest_nod
210 create_ddg_dep_from_intra_loop_link(ddg_ptr g, ddg_node_ptr src_node, ddg_node_ptr dest_node, dep_t link) argument
540 ddg_node_ptr src_node; local
[all...]
H A Dtree-inline.h73 struct cgraph_node *src_node; member in struct:copy_body_data
H A Dcgraphunit.c1211 cgraph_node *src_node = cgraph_node::get (p->decl); local
1212 if (src_node && src_node->definition)
1213 src_node->reset ();
H A Dtree-inline.c1991 edge = id->src_node->get_edge (orig_stmt);
2087 || !id->src_node->definition
2687 for (in_edge = id->src_node->callers; in_edge;
2690 freqs_to_counts (id->src_node, count > in_count ? count : in_count);
4582 id->src_node = cg_edge->callee;
4959 id.src_node = id.dst_node = cgraph_node::get (fn);
5708 id.src_node = old_version_node;
H A Domp-low.c1518 ctx->cb.src_node = cgraph_node::get (current_function_decl);
1519 gcc_checking_assert (ctx->cb.src_node);
1520 ctx->cb.dst_node = ctx->cb.src_node;
10868 tcctx.cb.src_node = cgraph_node::get (tcctx.cb.src_fn);
10869 gcc_checking_assert (tcctx.cb.src_node);
10870 tcctx.cb.dst_node = tcctx.cb.src_node;

Completed in 95 milliseconds