Home
last modified time | relevance | path

Searched refs:node2 (Results 1 – 25 of 32) sorted by relevance

12

/dflybsd-src/contrib/gcc-4.7/gcc/
H A Dipa-utils.c250 struct cgraph_node *node, *node2; in ipa_reverse_postorder() local
284 node2 = NULL; in ipa_reverse_postorder()
285 while (stack[stack_size].edge && !node2) in ipa_reverse_postorder()
288 node2 = edge->caller; in ipa_reverse_postorder()
296 node2 = NULL; in ipa_reverse_postorder()
300 ref) && !node2; in ipa_reverse_postorder()
304 node2 = ipa_ref_refering_node (ref); in ipa_reverse_postorder()
306 if (!node2) in ipa_reverse_postorder()
308 if (!node2->aux) in ipa_reverse_postorder()
310 stack[++stack_size].node = node2; in ipa_reverse_postorder()
[all …]
H A Dcgraph.c417 struct cgraph_node *node2) in cgraph_call_node_duplication_hooks() argument
422 entry->hook (node1, node2, entry->data); in cgraph_call_node_duplication_hooks()
1426 struct cgraph_node **node2 = &node->origin->nested; in cgraph_remove_node() local
1428 while (*node2 != node) in cgraph_remove_node()
1429 node2 = &(*node2)->next_nested; in cgraph_remove_node()
1430 *node2 = node->next_nested; in cgraph_remove_node()
2341 struct cgraph_node **node2 = &node->origin->nested; in cgraph_unnest_node() local
2344 while (*node2 != node) in cgraph_unnest_node()
2345 node2 = &(*node2)->next_nested; in cgraph_unnest_node()
2346 *node2 = node->next_nested; in cgraph_unnest_node()
H A Dcgraphunit.c394 clone_of_p (struct cgraph_node *node, struct cgraph_node *node2) in clone_of_p() argument
397 node2 = cgraph_function_or_thunk_node (node2, NULL); in clone_of_p()
398 while (node != node2 && node2) in clone_of_p()
399 node2 = node2->clone_of; in clone_of_p()
400 return node2 != NULL; in clone_of_p()
H A Dvar-tracking.c2432 location_chain node, node2; in variable_union() local
2450 node2 = dst->var_part[j].loc_chain; node && node2; in variable_union()
2451 node = node->next, node2 = node2->next) in variable_union()
2453 if (!((REG_P (node2->loc) in variable_union()
2455 && REGNO (node2->loc) == REGNO (node->loc)) in variable_union()
2456 || rtx_equal_p (node2->loc, node->loc))) in variable_union()
2458 if (node2->init < node->init) in variable_union()
2459 node2->init = node->init; in variable_union()
2463 if (node || node2) in variable_union()
2484 node2 = dstnode; in variable_union()
[all …]
/dflybsd-src/contrib/gcc-8.0/gcc/
H A Dipa-utils.c279 struct cgraph_node *node, *node2; in ipa_reverse_postorder() local
313 node2 = NULL; in ipa_reverse_postorder()
314 while (stack[stack_size].edge && !node2) in ipa_reverse_postorder()
317 node2 = edge->caller; in ipa_reverse_postorder()
325 node2 = NULL; in ipa_reverse_postorder()
329 ref) && !node2; in ipa_reverse_postorder()
333 node2 = dyn_cast <cgraph_node *> (ref->referring); in ipa_reverse_postorder()
335 if (!node2) in ipa_reverse_postorder()
337 if (!node2->aux) in ipa_reverse_postorder()
339 stack[++stack_size].node = node2; in ipa_reverse_postorder()
[all …]
H A Dcgraph.c490 cgraph_node *node2) in call_cgraph_duplication_hooks() argument
495 entry->hook (node, node2, entry->data); in call_cgraph_duplication_hooks()
1836 cgraph_node **node2 = &origin->nested; in remove() local
1838 while (*node2 != this) in remove()
1839 node2 = &(*node2)->next_nested; in remove()
1840 *node2 = next_nested; in remove()
2278 cgraph_node **node2 = &origin->nested; in unnest() local
2281 while (*node2 != this) in unnest()
2282 node2 = &(*node2)->next_nested; in unnest()
2283 *node2 = next_nested; in unnest()
[all …]
H A Dsymbol-summary.h175 static void symtab_duplication (cgraph_node *node, cgraph_node *node2, in class()
181 gcc_checking_assert (node2->summary_uid > 0); in class()
188 summary->m_map.put (node2->summary_uid, duplicate); in class()
189 summary->duplicate (node, node2, data, duplicate); in class()
H A Dvar-tracking.c2891 location_chain *node, *node2; in variable_union() local
2909 node2 = dst->var_part[j].loc_chain; node && node2; in variable_union()
2910 node = node->next, node2 = node2->next) in variable_union()
2912 if (!((REG_P (node2->loc) in variable_union()
2914 && REGNO (node2->loc) == REGNO (node->loc)) in variable_union()
2915 || rtx_equal_p (node2->loc, node->loc))) in variable_union()
2917 if (node2->init < node->init) in variable_union()
2918 node2->init = node->init; in variable_union()
2922 if (node || node2) in variable_union()
2943 node2 = dstnode; in variable_union()
[all …]
/dflybsd-src/contrib/dhcpcd/src/
H A Droute.c131 rt_compare_os(__unused void *context, const void *node1, const void *node2) in rt_compare_os() argument
133 const struct rt *rt1 = node1, *rt2 = node2; in rt_compare_os()
148 rt_compare_list(__unused void *context, const void *node1, const void *node2) in rt_compare_list() argument
150 const struct rt *rt1 = node1, *rt2 = node2; in rt_compare_list()
160 rt_compare_proto(void *context, const void *node1, const void *node2) in rt_compare_proto() argument
162 const struct rt *rt1 = node1, *rt2 = node2; in rt_compare_proto()
225 rt_compare_free(__unused void *context, const void *node1, const void *node2) in rt_compare_free() argument
228 return node1 == node2 ? 0 : node1 < node2 ? -1 : 1; in rt_compare_free()
/dflybsd-src/sys/netgraph7/netgraph/
H A Dng_base.c220 node_p node2, const char *name2);
647 node_p node2 = NULL; in ng_make_node_common() local
651 NG_IDHASH_FIND(node->nd_ID, node2); /* already taken? */ in ng_make_node_common()
652 if ((node->nd_ID != 0) && (node2 == NULL)) { in ng_make_node_common()
813 node_p node2; in ng_name_node() local
836 LIST_FOREACH(node2, &ng_name_hash[hash], nd_nodes) in ng_name_node()
837 if (NG_NODE_IS_VALID(node2) && in ng_name_node()
838 (strcmp(NG_NODE_NAME(node2), name) == 0)) { in ng_name_node()
946 node_p node, node2; in ng_name_rehash() local
955 LIST_FOREACH_MUTABLE(node, &ng_name_hash[i], nd_nodes, node2) { in ng_name_rehash()
[all …]
/dflybsd-src/contrib/awk/
H A Dparse.c60 Node *node2(int a, Node *b, Node *c) in node2() function
109 x = node2(a,b,c); in stat2()
145 x = node2(a,b,c); in op2()
H A Dproto.h73 extern Node *node2(int, Node *, Node *);
/dflybsd-src/sys/vfs/tmpfs/
H A Dtmpfs_subr.c1459 tmpfs_lock4(struct tmpfs_node *node1, struct tmpfs_node *node2, in tmpfs_lock4() argument
1462 if (node1->tn_dir.tn_parent != node2 && in tmpfs_lock4()
1463 (node1 < node2 || node2->tn_dir.tn_parent == node1)) { in tmpfs_lock4()
1466 TMPFS_NODE_LOCK(node2); /* tdir */ in tmpfs_lock4()
1470 TMPFS_NODE_LOCK(node2); /* tdir */ in tmpfs_lock4()
1479 tmpfs_unlock4(struct tmpfs_node *node1, struct tmpfs_node *node2, in tmpfs_unlock4() argument
1484 TMPFS_NODE_UNLOCK(node2); in tmpfs_unlock4()
H A Dtmpfs.h435 void tmpfs_lock4(struct tmpfs_node *node1, struct tmpfs_node *node2,
437 void tmpfs_unlock4(struct tmpfs_node *node1, struct tmpfs_node *node2,
/dflybsd-src/sys/netgraph/netgraph/
H A Dng_base.c934 node_p node2; in ng_mkpeer() local
952 if ((error = ng_make_node(type, &node2))) { in ng_mkpeer()
956 if ((error = ng_add_hook(node2, name2, &hook2))) { in ng_mkpeer()
957 ng_rmnode(node2); in ng_mkpeer()
967 ng_rmnode(node2); in ng_mkpeer()
975 ng_con_nodes(node_p node, const char *name, node_p node2, const char *name2) in ng_con_nodes() argument
983 if ((error = ng_add_hook(node2, name2, &hook2))) { in ng_con_nodes()
1277 node_p node2; in ng_generic_msg() local
1286 error = ng_path2node(here, con->path, &node2, NULL); in ng_generic_msg()
1289 error = ng_con_nodes(here, con->ourhook, node2, con->peerhook); in ng_generic_msg()
/dflybsd-src/sys/vfs/hammer/
H A Dhammer_undo.c42 hammer_und_rb_compare(hammer_undo_t node1, hammer_undo_t node2) in hammer_und_rb_compare() argument
44 if (node1->offset < node2->offset) in hammer_und_rb_compare()
46 if (node1->offset > node2->offset) in hammer_und_rb_compare()
H A Dhammer_ondisk.c79 hammer_nod_rb_compare(hammer_node_t node1, hammer_node_t node2) in hammer_nod_rb_compare() argument
81 if (node1->node_offset < node2->node_offset) in hammer_nod_rb_compare()
83 if (node1->node_offset > node2->node_offset) in hammer_nod_rb_compare()
/dflybsd-src/contrib/libarchive/libarchive/
H A Darchive_ppmd7.c220 CPpmd7_Node *node2 = NODE(n) + nu; in GlueFreeBlocks() local
221 nu += node2->NU; in GlueFreeBlocks()
222 if (node2->Stamp != 0 || nu >= 0x10000) in GlueFreeBlocks()
224 NODE(node2->Prev)->Next = node2->Next; in GlueFreeBlocks()
225 NODE(node2->Next)->Prev = node2->Prev; in GlueFreeBlocks()
H A Darchive_ppmd8.c170 CPpmd8_Node *node2; in GlueFreeBlocks() local
173 while ((node2 = node + node->NU)->Stamp == EMPTY_NODE) in GlueFreeBlocks()
175 node->NU += node2->NU; in GlueFreeBlocks()
176 node2->NU = 0; in GlueFreeBlocks()
/dflybsd-src/sys/netgraph/ksocket/
H A Dng_ksocket.c1156 node_p node2; in ng_ksocket_finish_accept() local
1192 if (ng_ksocket_constructor(&node2) != 0) { in ng_ksocket_finish_accept()
1197 priv2 = (priv_p)node2->private; in ng_ksocket_finish_accept()
1209 so->so_upcallarg = (caddr_t)node2; in ng_ksocket_finish_accept()
1216 resp_data->nodeid = node2->ID; in ng_ksocket_finish_accept()
/dflybsd-src/contrib/gcc-8.0/gcc/lto/
H A Dlto-symtab.c990 symtab_node *node2; in lto_symtab_merge_symbols() local
1053 && (node2 = symtab_node::get (vnode->decl)) in lto_symtab_merge_symbols()
1054 && node2 != node) in lto_symtab_merge_symbols()
1055 lto_varpool_replace_node (dyn_cast <varpool_node *> (node2), in lto_symtab_merge_symbols()
/dflybsd-src/contrib/cvs-1.12/src/
H A Dhash.c439 Node **node2 = (Node **) elem2; in qsort_comp() local
440 return client_comp (*node1, *node2); in qsort_comp()
/dflybsd-src/lib/libdmsg/
H A Dmsg_lnk.c227 h2span_node_cmp(h2span_node_t *node1, h2span_node_t *node2) in h2span_node_cmp() argument
231 r = strcmp(node1->pfs_label, node2->pfs_label); in h2span_node_cmp()
233 r = uuid_compare(&node1->pfs_id, &node2->pfs_id, NULL); in h2span_node_cmp()
/dflybsd-src/sys/netgraph/
H A Dnetgraph.h329 const char *name, node_p node2, const char *name2);
/dflybsd-src/sys/vfs/devfs/
H A Ddevfs_core.c634 struct devfs_node *node1, *node2; in devfs_iterate_topology() local
640 link, node2) { in devfs_iterate_topology()
1821 struct devfs_node *node1, *node2; in devfs_alias_apply() local
1827 TAILQ_FOREACH_MUTABLE(node1, DEVFS_DENODE_HEAD(node), link, node2) { in devfs_alias_apply()

12