Home
last modified time | relevance | path

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

/openbsd/gnu/gcc/gcc/
H A Dddg.c150 create_ddg_dependence (ddg_ptr g, ddg_node_ptr src_node, in create_ddg_dependence() argument
155 int interloop = (src_node->cuid >= dest_node->cuid); in create_ddg_dependence()
157 dep_data_type dt = (mem_access_insn_p (src_node->insn) in create_ddg_dependence()
184 if (!(t == OUTPUT_DEP && src_node == dest_node) in create_ddg_dependence()
232 ddg_node_ptr src_node = get_node_of_insn (g, def_insn); in add_deps_for_def() local
243 gcc_assert (src_node && dest_node); in add_deps_for_def()
247 create_ddg_dep_no_link (g, src_node, dest_node, TRUE_DEP, in add_deps_for_def()
268 for (i = src_node->cuid + 1; i < g->num_nodes; i++) in add_deps_for_def()
401 if (!src_node) in build_intra_loop_deps()
405 create_ddg_dependence (g, src_node, dest_node, in build_intra_loop_deps()
[all …]
H A Dtree-inline.h40 struct cgraph_node *src_node; member
H A Dtree-inline.c729 edge = cgraph_edge (id->src_node, orig_stmt); in copy_bb()
2081 id->src_node = cg_edge->callee; in expand_call_inline()
2229 id.src_node = id.dst_node = cgraph_node (fn); in optimize_inline_calls()
2803 id.src_node = old_version_node; in tree_function_versioning()
H A Domp-low.c841 ctx->cb.src_node = cgraph_node (current_function_decl); in new_omp_context()
842 ctx->cb.dst_node = ctx->cb.src_node; in new_omp_context()
/openbsd/lib/libexpat/lib/
H A Dxmlparse.c7739 const int src_node = (int)dest->numchildren; in build_model() local
7742 dest->type = dtd->scaffold[src_node].type; in build_model()
7743 dest->quant = dtd->scaffold[src_node].quant; in build_model()
7747 src = dtd->scaffold[src_node].name; in build_model()
7760 dest->numchildren = dtd->scaffold[src_node].childcnt; in build_model()
7764 for (i = 0, cn = dtd->scaffold[src_node].firstchild; in build_model()