Home
last modified time | relevance | path

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

/dragonfly/contrib/tcpdump/
H A Dprint-tipc.c115 nd_uint32_t dest_node; member
129 nd_uint32_t dest_node; member
171 u_int dest_node; in print_payload() local
192 dest_node = GET_BE_U_4(ap->dest_node); in print_payload()
197 TIPC_ZONE(dest_node), TIPC_CLUSTER(dest_node), TIPC_NODE(dest_node), in print_payload()
232 u_int dest_node; in print_internal() local
244 dest_node = GET_BE_U_4(ap->dest_node); in print_internal()
248 TIPC_ZONE(dest_node), TIPC_CLUSTER(dest_node), TIPC_NODE(dest_node), in print_internal()
/dragonfly/contrib/gcc-8.0/gcc/
H A Dddg.c180 && mem_access_insn_p (dest_node->insn) ? MEM_DEP in create_ddg_dep_from_intra_loop_link()
182 gcc_assert (src_node->cuid < dest_node->cuid); in create_ddg_dep_from_intra_loop_link()
206 && !def_has_ccmode_p (dest_node->insn) in create_ddg_dep_from_intra_loop_link()
211 set = single_set (dest_node->insn); in create_ddg_dep_from_intra_loop_link()
356 ddg_node_ptr dest_node; in add_cross_iteration_register_deps() local
362 gcc_assert (dest_node); in add_cross_iteration_register_deps()
493 ddg_node_ptr dest_node = &g->nodes[i]; in build_intra_loop_deps() local
497 if (! INSN_P (dest_node->insn)) in build_intra_loop_deps()
520 if (mem_access_insn_p (dest_node->insn)) in build_intra_loop_deps()
534 add_inter_loop_mem_dep (g, dest_node, j_node); in build_intra_loop_deps()
[all …]
H A Dipa-utils.c682 struct cgraph_node *dest_node = cgraph_node::get_create (dest); in recursive_call_p() local
688 if (cnode != dest_node->ultimate_alias_target (&avail)) in recursive_call_p()
692 if (!dest_node->semantically_equivalent_p (cnode)) in recursive_call_p()
697 if (!dest_node->semantically_equivalent_p (alias->referring)) in recursive_call_p()
/dragonfly/contrib/gcc-4.7/gcc/
H A Dddg.c199 gcc_assert (src_node->cuid < dest_node->cuid); in create_ddg_dep_from_intra_loop_link()
223 && !def_has_ccmode_p (dest_node->insn) in create_ddg_dep_from_intra_loop_link()
228 set = single_set (dest_node->insn); in create_ddg_dep_from_intra_loop_link()
373 ddg_node_ptr dest_node; in add_cross_iteration_register_deps() local
379 gcc_assert (dest_node); in add_cross_iteration_register_deps()
526 ddg_node_ptr dest_node = &g->nodes[i]; in build_intra_loop_deps() local
530 if (! INSN_P (dest_node->insn)) in build_intra_loop_deps()
545 if (mem_access_insn_p (dest_node->insn)) in build_intra_loop_deps()
558 if (! TEST_BIT (dest_node->successors, j)) in build_intra_loop_deps()
559 add_inter_loop_mem_dep (g, dest_node, j_node); in build_intra_loop_deps()
[all …]
H A Dipa-ref.c204 ipa_clone_references (struct cgraph_node *dest_node, in ipa_clone_references() argument
211 ipa_record_reference (dest_node, dest_varpool_node, in ipa_clone_references()
222 ipa_clone_refering (struct cgraph_node *dest_node, in ipa_clone_refering() argument
234 dest_node, dest_varpool_node, in ipa_clone_refering()
/dragonfly/contrib/cvs-1.12/lib/
H A Dregexec.c1247 Idx dest_node; in proceed_next_node() local
1258 if (dest_node == REG_MISSING) in proceed_next_node()
1259 dest_node = candidate; in proceed_next_node()
1278 return dest_node; in proceed_next_node()
1309 Idx dest_node; in proceed_next_node() local
1315 dest_node)) in proceed_next_node()
1316 return dest_node; in proceed_next_node()
1323 Idx dest_node = dfa->nexts[node]; in proceed_next_node() local
1327 dest_node))) in proceed_next_node()
1330 return dest_node; in proceed_next_node()
[all …]
/dragonfly/contrib/diffutils/lib/
H A Dregexec.c1242 Idx dest_node; in proceed_next_node() local
1253 if (dest_node == -1) in proceed_next_node()
1254 dest_node = candidate; in proceed_next_node()
1273 return dest_node; in proceed_next_node()
1304 Idx dest_node; in proceed_next_node() local
1310 dest_node)) in proceed_next_node()
1311 return dest_node; in proceed_next_node()
1318 Idx dest_node = dfa->nexts[node]; in proceed_next_node() local
1322 dest_node))) in proceed_next_node()
1325 return dest_node; in proceed_next_node()
[all …]
/dragonfly/contrib/grep/lib/
H A Dregexec.c1223 Idx dest_node; in proceed_next_node() local
1234 if (dest_node == -1) in proceed_next_node()
1235 dest_node = candidate; in proceed_next_node()
1254 return dest_node; in proceed_next_node()
1290 Idx dest_node; in proceed_next_node() local
1296 dest_node)) in proceed_next_node()
1297 return dest_node; in proceed_next_node()
1304 Idx dest_node = dfa->nexts[node]; in proceed_next_node() local
1308 dest_node))) in proceed_next_node()
1311 return dest_node; in proceed_next_node()
[all …]