| /openbsd-src/gnu/gcc/gcc/ |
| H A D | ipa.c | 33 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()
61 node2->aux = edge->next_caller; in cgraph_postorder()
63 node2->aux = &last; in cgraph_postorder()
70 stack[stack_size++] = node2; in cgraph_postorder()
71 node2 = edge->caller; in cgraph_postorder()
75 if (node2->aux == &last) in cgraph_postorder()
[all …]
|
| H A D | cgraph.c | 543 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 D | var-tracking.c | 1123 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-src/gnu/usr.bin/gcc/gcc/ |
| H A D | et-forest.c | 129 et_forest_occurrence_t node1, node2; local
134 node2 = parent->right;
137 grandparent->left = node2;
139 if (node2)
140 node2->parent = grandparent;
165 et_forest_occurrence_t node1, node2; local
170 node2 = node->right;
177 parent->left = node2;
179 if (node2)
180 node2->parent = parent;
[all …]
|
| H A D | dominance.c | 673 et_forest_node_t node2 = BB_NODE (dom, to); local
680 et_forest_add_edge (dom->forest, node2, bbs[i]);
|
| /openbsd-src/usr.sbin/ldomctl/ |
| H A D | config.c | 146 struct md_node *node2; in pri_link_core() local
154 node2 = prop->d.arc.node; in pri_link_core()
155 if (strcmp(node2->name->str, "cpu") != 0) { in pri_link_core()
156 pri_link_core(md, node2, core); in pri_link_core()
161 if (!md_get_prop_val(md, node2, "pid", &pid)) in pri_link_core()
162 md_get_prop_val(md, node2, "id", &pid); in pri_link_core()
424 struct md_node *node, *node2; in pri_init() local
456 node2 = prop->d.arc.node; in pri_init()
457 if (!md_get_prop_val(md, node2, "guest_use", in pri_init()
460 if (!md_get_prop_val(md, node2, "offset", &offset) || in pri_init()
[all …]
|
| H A D | mdesc.c | 154 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-src/gnu/llvm/llvm/lib/Target/AArch64/ |
| H A D | AArch64PBQPRegAlloc.cpp | 174 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-src/gnu/usr.bin/gcc/gcc/f/ |
| H A D | com.h | 201 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 D | com.c | 9569 tree node2) in ffecom_2() argument
9574 || (node2 == error_mark_node) in ffecom_2()
9588 TREE_CHAIN (item) = build_tree_list (TREE_CHAIN (TYPE_FIELDS (type)), node2); in ffecom_2()
9595 item = build (code, type, node1, node2); in ffecom_2()
9599 node2 = ffecom_stabilize_aggregate_ (node2); in ffecom_2()
9607 node2)), in ffecom_2()
9612 node2))); in ffecom_2()
9618 item = build (code, type, node1, node2); in ffecom_2()
9622 node2 = ffecom_stabilize_aggregate_ (node2); in ffecom_2()
9630 node2)), in ffecom_2()
[all …]
|
| /openbsd-src/usr.bin/awk/ |
| H A D | parse.c | 61 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 D | proto.h | 71 extern Node *node2(int, Node *, Node *);
|
| /openbsd-src/gnu/llvm/compiler-rt/lib/tsan/tests/unit/ |
| H A D | tsan_ilist_test.cpp | 20 INode node2; member
86 IList<Node, &Node::node2, Parent> list2; in TEST()
|
| /openbsd-src/sys/dev/microcode/aic7xxx/ |
| H A D | aicasm_symbol.c | 297 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-src/gnu/usr.bin/cvs/src/ |
| H A D | hash.c | 390 Node **node2 = (Node **) elem2; local
391 return client_comp (*node1, *node2);
|