HomeSort by: relevance | last modified time | path
    Searched defs:dest_node (Results 1 - 6 of 6) sorted by relevancy

  /src/external/bsd/tcpdump/dist/
print-tipc.c 117 nd_uint32_t dest_node; member in struct:payload_tipc_pkthdr
131 nd_uint32_t dest_node; member in struct:internal_tipc_pkthdr
173 u_int dest_node; local
194 dest_node = GET_BE_U_4(ap->dest_node);
199 TIPC_ZONE(dest_node), TIPC_CLUSTER(dest_node), TIPC_NODE(dest_node),
235 u_int dest_node; local
247 dest_node = GET_BE_U_4(ap->dest_node)
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
ipa-utils.cc 765 struct cgraph_node *dest_node = cgraph_node::get_create (dest); local
771 if (cnode != dest_node->ultimate_alias_target (&avail))
775 if (!dest_node->semantically_equivalent_p (cnode))
780 if (!dest_node->semantically_equivalent_p (alias->referring))
ddg.cc 172 ddg_node_ptr dest_node, dep_t link)
178 && mem_access_insn_p (dest_node->insn) ? MEM_DEP
180 gcc_assert (src_node->cuid < dest_node->cuid);
194 If the address that is being auto-inc or auto-dec in DEST_NODE
201 && !def_has_ccmode_p (dest_node->insn)
202 && !autoinc_var_is_used_p (dest_node->insn, src_node->insn))
206 set = single_set (dest_node->insn);
224 e = create_ddg_edge (src_node, dest_node, t, dt, latency, distance);
460 ddg_node_ptr dest_node = &g->nodes[i];
464 FOR_EACH_DEP (dest_node->insn, SD_LIST_BACK, sd_it, dep
459 ddg_node_ptr dest_node = &g->nodes[i]; local
    [all...]
  /src/external/gpl3/gcc/dist/gcc/
ipa-utils.cc 769 struct cgraph_node *dest_node = cgraph_node::get_create (dest); local
775 if (cnode != dest_node->ultimate_alias_target (&avail))
779 if (!dest_node->semantically_equivalent_p (cnode))
784 if (!dest_node->semantically_equivalent_p (alias->referring))
ddg.cc 172 ddg_node_ptr dest_node, dep_t link)
178 && mem_access_insn_p (dest_node->insn) ? MEM_DEP
180 gcc_assert (src_node->cuid < dest_node->cuid);
194 If the address that is being auto-inc or auto-dec in DEST_NODE
201 && !def_has_ccmode_p (dest_node->insn)
202 && !autoinc_var_is_used_p (dest_node->insn, src_node->insn))
206 set = single_set (dest_node->insn);
224 e = create_ddg_edge (src_node, dest_node, t, dt, latency, distance);
460 ddg_node_ptr dest_node = &g->nodes[i];
464 FOR_EACH_DEP (dest_node->insn, SD_LIST_BACK, sd_it, dep
459 ddg_node_ptr dest_node = &g->nodes[i]; local
    [all...]
  /src/external/gpl2/xcvs/dist/lib/
regexec.c 71 Idx str_idx, Idx dest_node, Idx nregs,
1253 Idx dest_node;
1259 for (dest_node = REG_MISSING, i = 0; i < edests->nelem; ++i)
1264 if (dest_node == REG_MISSING)
1265 dest_node = candidate;
1271 if (re_node_set_contains (eps_via_nodes, dest_node))
1284 return dest_node;
1315 Idx dest_node;
1319 dest_node = dfa->edests[node].elems[0];
1321 dest_node))
1250 Idx dest_node; local
1312 Idx dest_node; local
1326 Idx dest_node = dfa->nexts[node]; local
    [all...]

Completed in 20 milliseconds