Home
last modified time | relevance | path

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

/openbsd/gnu/gcc/gcc/
H A Dipa.c33 struct cgraph_node *node, *node2; in cgraph_postorder() local
50 node2 = node; in cgraph_postorder()
55 while (node2) in cgraph_postorder()
57 while (node2->aux != &last) in cgraph_postorder()
59 edge = node2->aux; in cgraph_postorder()
63 node2->aux = &last; in cgraph_postorder()
71 node2 = edge->caller; in cgraph_postorder()
75 if (node2->aux == &last) in cgraph_postorder()
77 order[order_pos++] = node2; in cgraph_postorder()
79 node2 = stack[--stack_size]; in cgraph_postorder()
[all …]
H A Dcgraph.c543 struct cgraph_node **node2 = &node->origin->nested; in cgraph_remove_node() local
545 while (*node2 != node) in cgraph_remove_node()
546 node2 = &(*node2)->next_nested; in cgraph_remove_node()
547 *node2 = node->next_nested; in cgraph_remove_node()
1134 struct cgraph_node **node2 = &node->origin->nested; in cgraph_unnest_node() local
1137 while (*node2 != node) in cgraph_unnest_node()
1138 node2 = &(*node2)->next_nested; in cgraph_unnest_node()
1139 *node2 = node->next_nested; in cgraph_unnest_node()
H A Dvar-tracking.c1123 location_chain node, node2; in variable_union() local
1141 node2 = dst->var_part[j].loc_chain; node && node2; in variable_union()
1142 node = node->next, node2 = node2->next) in variable_union()
1144 if (!((REG_P (node2->loc) in variable_union()
1146 && REGNO (node2->loc) == REGNO (node->loc)) in variable_union()
1147 || rtx_equal_p (node2->loc, node->loc))) in variable_union()
1150 if (node || node2) in variable_union()
/openbsd/gnu/usr.bin/gcc/gcc/
H A Det-forest.c139 if (node2)
170 node2 = node->right;
179 if (node2)
180 node2->parent = parent;
209 node2 = node->right;
218 if (node2)
250 if (node2)
606 if (node1 == node2)
609 if (! node1 || ! node2)
613 splay (node2->first);
[all …]
H A Ddominance.c673 et_forest_node_t node2 = BB_NODE (dom, to); local
680 et_forest_add_edge (dom->forest, node2, bbs[i]);
/openbsd/usr.sbin/ldomctl/
H A Dconfig.c146 struct md_node *node2; in pri_link_core() local
154 node2 = prop->d.arc.node; in pri_link_core()
598 struct md_node *node2; in hvmd_init_mblock() local
652 struct md_node *node2; in hvmd_init_cpu() local
690 struct md_node *node2; in hvmd_init_device() local
794 struct md_node *node2; in hvmd_init_guest() local
1687 return node2; in guest_find_vcc()
1763 return node2; in guest_find_vds()
1836 return node2; in guest_find_vsw()
2123 vc = node2; in guest_find_vc()
[all …]
H A Dmdesc.c154 md_link_node(struct md *md, struct md_node *node1, struct md_node *node2) in md_link_node() argument
156 md_add_prop_arc(md, node1, "fwd", node2); in md_link_node()
157 md_add_prop_arc(md, node2, "back", node1); in md_link_node()
322 struct md_node *node2; in md_delete_node() local
325 TAILQ_FOREACH(node2, &md->node_list, link) { in md_delete_node()
326 TAILQ_FOREACH_SAFE(prop, &node2->prop_list, link, prop2) { in md_delete_node()
329 md_delete_prop(md, node2, prop); in md_delete_node()
405 struct md_node *node, *node2; in md_collect_garbage() local
412 TAILQ_FOREACH_SAFE(node, &md->node_list, link, node2) { in md_collect_garbage()
/openbsd/gnu/llvm/llvm/lib/Target/AArch64/
H A DAArch64PBQPRegAlloc.cpp174 PBQPRAGraph::NodeId node2 = G.getMetadata().getNodeIdForVReg(Ra); in addIntraChainConstraint() local
179 &G.getNodeMetadata(node2).getAllowedRegs(); in addIntraChainConstraint()
181 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2); in addIntraChainConstraint()
202 G.addEdge(node1, node2, std::move(costs)); in addIntraChainConstraint()
206 if (G.getEdgeNode1Id(edge) == node2) { in addIntraChainConstraint()
207 std::swap(node1, node2); in addIntraChainConstraint()
273 PBQPRAGraph::NodeId node2 = G.getMetadata().getNodeIdForVReg(r); in addInterChainConstraint() local
275 &G.getNodeMetadata(node2).getAllowedRegs(); in addInterChainConstraint()
277 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2); in addInterChainConstraint()
283 if (G.getEdgeNode1Id(edge) == node2) { in addInterChainConstraint()
[all …]
/openbsd/gnu/usr.bin/gcc/gcc/f/
H A Dcom.h201 tree ffecom_2 (enum tree_code code, tree type, tree node1, tree node2);
204 tree ffecom_2s (enum tree_code code, tree type, tree node1, tree node2);
205 tree ffecom_3 (enum tree_code code, tree type, tree node1, tree node2,
207 tree ffecom_3s (enum tree_code code, tree type, tree node1, tree node2,
H A Dcom.c9569 tree node2) in ffecom_2() argument
9599 node2 = ffecom_stabilize_aggregate_ (node2); in ffecom_2()
9607 node2)), in ffecom_2()
9622 node2 = ffecom_stabilize_aggregate_ (node2); in ffecom_2()
9630 node2)), in ffecom_2()
9645 node2 = ffecom_stabilize_aggregate_ (node2); in ffecom_2()
9652 node2)); in ffecom_2()
9654 node2)); in ffecom_2()
9683 node2 = ffecom_stabilize_aggregate_ (node2); in ffecom_2()
9709 node2 = ffecom_stabilize_aggregate_ (node2); in ffecom_2()
[all …]
/openbsd/usr.sbin/unbound/testcode/
H A Dunitmain.c1260 struct local_zone *node1, *node2; in compare_localzone_trees() local
1266 node2=(struct local_zone*)rbtree_first(&z2->ztree); in compare_localzone_trees()
1268 (rbnode_type*)node2 != RBTREE_NULL; in compare_localzone_trees()
1270 node2=(struct local_zone*)rbtree_next((rbnode_type*)node2)) { in compare_localzone_trees()
1275 node2->name, node2->namelabs, in compare_localzone_trees()
1279 (node1->parent == NULL && node2->parent == NULL) || in compare_localzone_trees()
1280 (node1->parent != NULL && node2->parent != NULL)); in compare_localzone_trees()
1284 node2->parent->name, node2->parent->namelabs, in compare_localzone_trees()
/openbsd/usr.bin/awk/
H A Dparse.c61 Node *node2(int a, Node *b, Node *c) in node2() function
124 x = node2(a,b,c); in stat2()
160 x = node2(a,b,c); in op2()
H A Dproto.h71 extern Node *node2(int, Node *, Node *);
/openbsd/gnu/llvm/compiler-rt/lib/tsan/tests/unit/
H A Dtsan_ilist_test.cpp20 INode node2; member
86 IList<Node, &Node::node2, Parent> list2; in TEST()
/openbsd/sys/dev/microcode/aic7xxx/
H A Daicasm_symbol.c297 symbol_node_t *node1, *node2; in symlist_free() local
301 node2 = SLIST_NEXT(node1, links); in symlist_free()
303 node1 = node2; in symlist_free()
/openbsd/gnu/usr.bin/cvs/src/
H A Dhash.c390 Node **node2 = (Node **) elem2; local
391 return client_comp (*node1, *node2);