Home
last modified time | relevance | path

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

123

/netbsd-src/external/apache2/llvm/dist/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 …]
/netbsd-src/external/gpl2/dtc/dist/tests/
H A Domit-no-ref.dts11 node2: node2 { label
24 /omit-if-no-ref/ &node2;
H A Dpylibfdt_tests.py137 node2 = self.fdt.path_offset('/subnode@1/subsubnode')
138 self.assertEquals(self.fdt.subnode_offset(node1, 'subsubnode'), node2)
335 node2 = self.fdt.path_offset('/subnode@2')
336 self.assertEquals(0x2000, libfdt.fdt_get_phandle(self.fdt._fdt, node2))
341 node2 = self.fdt.path_offset('/subnode@2')
342 self.assertEquals(0x2000, self.fdt.get_phandle(node2))
360 node2 = self.fdt.path_offset('/subnode@2/subsubnode@0')
361 self.assertEquals(node1, self.fdt.parent_offset(node2))
369 node2 = self.fdt.path_offset('/subnode@2/subsubnode@0')
370 self.assertEquals(node2, self.fdt.node_offset_by_phandle(0x2001))
[all …]
H A Dmultilabel_merge.dts11 ref = <&{/node2}>; /* reference precedes target */
14 node2 {
56 ny: n2: node2 {
H A Dpath-references.dts8 ref = &{/node2}; /* reference precedes target */
11 n2: node2 {
H A Dreferences.dts9 ref = <&{/node2}>; /* reference precedes target */
12 n2: node2 {
H A Dmultilabel.dts13 ref = <&{/node2}>; /* reference precedes target */
16 ny: n2: node2 {
H A Dprop-after-subnode.dts7 node2 {
H A Dbad-chosen.dts4 node2 {
H A Ddup-phandle.dts7 node2 {
H A Dreuse-label1.dts7 label: node2 {
H A Dreuse-label.dts12 label: node2 {
/netbsd-src/external/gpl3/gcc.old/dist/gcc/
H A Dipa-utils.c278 struct cgraph_node *node, *node2; in ipa_reverse_postorder() local
312 node2 = NULL; in ipa_reverse_postorder()
313 while (stack[stack_size].edge && !node2) in ipa_reverse_postorder()
316 node2 = edge->caller; in ipa_reverse_postorder()
324 node2 = NULL; in ipa_reverse_postorder()
328 ref) && !node2; in ipa_reverse_postorder()
332 node2 = dyn_cast <cgraph_node *> (ref->referring); in ipa_reverse_postorder()
334 if (!node2) in ipa_reverse_postorder()
336 if (!node2->aux) in ipa_reverse_postorder()
338 stack[++stack_size].node = node2; in ipa_reverse_postorder()
[all …]
H A Dsymbol-summary.h193 static void symtab_duplication (cgraph_node *node, cgraph_node *node2, in class()
269 cgraph_node *node2, void *data) in symtab_duplication() argument
275 summary->duplicate (node, node2, v, summary->get_create (node2)); in symtab_duplication()
402 static void symtab_duplication (cgraph_node *node, cgraph_node *node2,
470 cgraph_node *node2,
478 T *duplicate = summary->get_create (node2);
479 summary->duplicate (node, node2, v, duplicate);
H A Dcgraph.c488 cgraph_node *node2) in call_cgraph_duplication_hooks() argument
493 entry->hook (node, node2, entry->data); in call_cgraph_duplication_hooks()
1879 cgraph_node **node2 = &origin->nested; in remove() local
1881 while (*node2 != this) in remove()
1882 node2 = &(*node2)->next_nested; in remove()
1883 *node2 = next_nested; in remove()
2347 cgraph_node **node2 = &origin->nested; in unnest() local
2350 while (*node2 != this) in unnest()
2351 node2 = &(*node2)->next_nested; in unnest()
2352 *node2 = next_nested; in unnest()
[all …]
/netbsd-src/external/gpl3/gcc/dist/gcc/
H A Dipa-utils.cc278 struct cgraph_node *node, *node2; in ipa_reverse_postorder() local
312 node2 = NULL; in ipa_reverse_postorder()
313 while (stack[stack_size].edge && !node2) in ipa_reverse_postorder()
316 node2 = edge->caller; in ipa_reverse_postorder()
324 node2 = NULL; in ipa_reverse_postorder()
328 ref) && !node2; in ipa_reverse_postorder()
332 node2 = dyn_cast <cgraph_node *> (ref->referring); in ipa_reverse_postorder()
334 if (!node2) in ipa_reverse_postorder()
336 if (!node2->aux) in ipa_reverse_postorder()
338 stack[++stack_size].node = node2; in ipa_reverse_postorder()
[all …]
H A Dsymbol-summary.h242 static void symtab_duplication (cgraph_node *node, cgraph_node *node2, in class()
308 cgraph_node *node2, void *data) in symtab_duplication() argument
314 summary->duplicate (node, node2, v, summary->get_create (node2)); in symtab_duplication()
438 static void symtab_duplication (cgraph_node *node, cgraph_node *node2,
500 cgraph_node *node2,
508 T *duplicate = summary->get_create (node2);
509 summary->duplicate (node, node2, v, duplicate);
H A Dsplay-tree-utils.tcc930 node_type node2) in compare_nodes_one_way() argument
934 if (parent == node2) in compare_nodes_one_way()
945 node_type node2) in compare_nodes() argument
947 if (node1 == node2) in compare_nodes()
951 int cmp = compare_nodes_one_way (node1, node2); in compare_nodes()
957 cmp = compare_nodes_one_way (node2, node1); in compare_nodes()
/netbsd-src/external/bsd/dhcpcd/dist/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()
/netbsd-src/crypto/external/bsd/heimdal/dist/lib/roken/
H A Dtsearch-test.c39 node_compare(const void *node1, const void *node2) in node_compare() argument
42 ((const struct node *) node2)->string); in node_compare()
/netbsd-src/external/cddl/osnet/dist/uts/common/fs/zfs/
H A Dzfs_fuid.c75 const fuid_domain_t *node2 = arg2; in idx_compare() local
77 if (node1->f_idx < node2->f_idx) in idx_compare()
79 else if (node1->f_idx > node2->f_idx) in idx_compare()
91 const fuid_domain_t *node2 = arg2; in domain_compare() local
94 val = strcmp(node1->f_ksid->kd_name, node2->f_ksid->kd_name); in domain_compare()
/netbsd-src/external/gpl3/binutils.old/dist/gprofng/src/
H A DCallStack.cc1223 CallStackNode *node2 = (CallStackNode *) stack2; in compare() local
1224 while (node1 != NULL && node2 != NULL) in compare()
1228 if (node1->instr->id < node2->instr->id) in compare()
1230 else if (node1->instr->id > node2->instr->id) in compare()
1233 node2 = node2->ancestor; in compare()
1235 if (node1 == NULL && node2 != NULL) in compare()
1237 else if (node1 != NULL && node2 == NULL) in compare()
/netbsd-src/external/gpl3/binutils/dist/gprofng/src/
H A DCallStack.cc1223 CallStackNode *node2 = (CallStackNode *) stack2; in compare() local
1224 while (node1 != NULL && node2 != NULL) in compare()
1228 if (node1->instr->id < node2->instr->id) in compare()
1230 else if (node1->instr->id > node2->instr->id) in compare()
1233 node2 = node2->ancestor; in compare()
1235 if (node1 == NULL && node2 != NULL) in compare()
1237 else if (node1 != NULL && node2 == NULL) in compare()
/netbsd-src/crypto/external/bsd/heimdal/dist/doc/doxyout/ntlm/html/
H A Dstructntlm__type2__coll__graph.map3 <area shape="rect" id="node2" href="$structntlm__buf.html" title=" " alt="" coords="13,5,85,32"/>
H A Dstructntlm__type3__coll__graph.map3 <area shape="rect" id="node2" href="$structntlm__buf.html" title=" " alt="" coords="13,5,85,32"/>

123