| /netbsd-src/external/gpl3/gcc.old/dist/libobjc/ |
| H A D | hash.c | 125 node_ptr node1 = (*cachep)->node_table[indx]; in objc_hash_add() local
126 while (node1) in objc_hash_add()
128 assert (node1->key != key); in objc_hash_add()
129 node1 = node1->next; in objc_hash_add()
149 node_ptr node1 = NULL; in objc_hash_add() local
158 while ((node1 = objc_hash_next (*cachep, node1))) in objc_hash_add()
159 objc_hash_add (&new, node1->key, node1->value); in objc_hash_add()
|
| /netbsd-src/external/gpl3/gcc/dist/libobjc/ |
| H A D | hash.c | 125 node_ptr node1 = (*cachep)->node_table[indx]; in objc_hash_add() local
126 while (node1) in objc_hash_add()
128 assert (node1->key != key); in objc_hash_add()
129 node1 = node1->next; in objc_hash_add()
149 node_ptr node1 = NULL; in objc_hash_add() local
158 while ((node1 = objc_hash_next (*cachep, node1))) in objc_hash_add()
159 objc_hash_add (&new, node1->key, node1->value); in objc_hash_add()
|
| /netbsd-src/external/gpl3/gcc.old/dist/gcc/ |
| H A D | cgraph.h | 2738 symtab_node *node1 = next; in next_defined_symbol() local
2740 for (; node1; node1 = node1->next) in next_defined_symbol()
2741 if (node1->definition) in next_defined_symbol()
2742 return node1; in next_defined_symbol()
2931 symtab_node *node1 = node->next; in next_variable() local
2932 for (; node1; node1 = node1->next) in next_variable()
2933 if (varpool_node *vnode1 = dyn_cast <varpool_node *> (node1)) in next_variable()
2961 symtab_node *node1 = node->next; in next_static_initializer() local
2962 for (; node1; node1 = node1->next) in next_static_initializer()
2964 varpool_node *vnode1 = dyn_cast <varpool_node *> (node1); in next_static_initializer()
[all …]
|
| /netbsd-src/external/gpl3/gcc/dist/gcc/ |
| H A D | cgraph.h | 2717 symtab_node *node1 = next; in next_defined_symbol() local
2719 for (; node1; node1 = node1->next) in next_defined_symbol()
2720 if (node1->definition) in next_defined_symbol()
2721 return node1; in next_defined_symbol()
2910 symtab_node *node1 = node->next; in next_variable() local
2911 for (; node1; node1 = node1->next) in next_variable()
2912 if (varpool_node *vnode1 = dyn_cast <varpool_node *> (node1)) in next_variable()
2940 symtab_node *node1 = node->next; in next_static_initializer() local
2941 for (; node1; node1 = node1->next) in next_static_initializer()
2943 varpool_node *vnode1 = dyn_cast <varpool_node *> (node1); in next_static_initializer()
[all …]
|
| H A D | splay-tree-utils.tcc | 929 rootless_splay_tree<Accessors>::compare_nodes_one_way (node_type node1, in compare_nodes_one_way() argument
938 return splay_and_search (node1, 0, compare); in compare_nodes_one_way()
944 rootless_splay_tree<Accessors>::compare_nodes (node_type node1, 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/gpl2/texinfo/dist/makeinfo/tests/ |
| H A D | node-expand.txi | 12 @set node1 Node 1
22 * @value{node1} ::
29 @node @value{node1}, @@node `2', Top, Top
48 @node @@node `2', ``node'' with---tricks, @value{node1}, Top
54 @xref{@value{node1}}. @xref{Node 1}.
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/AArch64/ |
| H A D | AArch64PBQPRegAlloc.cpp | 173 PBQPRAGraph::NodeId node1 = G.getMetadata().getNodeIdForVReg(Rd); in addIntraChainConstraint() local
177 &G.getNodeMetadata(node1).getAllowedRegs(); in addIntraChainConstraint()
181 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2); in addIntraChainConstraint()
202 G.addEdge(node1, node2, std::move(costs)); in addIntraChainConstraint()
207 std::swap(node1, node2); in addIntraChainConstraint()
260 PBQPRAGraph::NodeId node1 = G.getMetadata().getNodeIdForVReg(Rd); in addInterChainConstraint() local
271 &G.getNodeMetadata(node1).getAllowedRegs(); in addInterChainConstraint()
277 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2); in addInterChainConstraint()
284 std::swap(node1, node2); in addInterChainConstraint()
|
| /netbsd-src/external/gpl2/dtc/dist/tests/ |
| H A D | multilabel_merge.dts | 9 n1: node1 {
16 ref = <&{/node1}>; /* reference after target */
51 nx: node1 {
|
| H A D | omit-no-ref.dts | 7 /omit-if-no-ref/ node1: node1 {
|
| H A D | path-references.dts | 7 n1: node1 {
12 ref = &{/node1}; /* reference after target */
|
| H A D | references.dts | 7 n1: node1 {
14 ref = <&{/node1}>; /* reference after target */
|
| H A D | multilabel.dts | 11 n1: nx: node1 {
18 ref = <&{/node1}>; /* reference after target */
|
| H A D | pylibfdt_tests.py | 130 node1 = self.fdt.path_offset('/subnode@1')
131 self.assertEquals(self.fdt.subnode_offset(0, 'subnode@1'), node1)
138 self.assertEquals(self.fdt.subnode_offset(node1, 'subsubnode'), node2)
358 node1 = self.fdt.path_offset('/subnode@2')
359 self.assertEquals(0, self.fdt.parent_offset(node1))
361 self.assertEquals(node1, self.fdt.parent_offset(node2))
367 node1 = self.fdt.path_offset('/subnode@2')
368 self.assertEquals(node1, self.fdt.node_offset_by_phandle(0x2000))
|
| H A D | prop-after-subnode.dts | 4 node1 {
|
| H A D | dup-phandle.dts | 4 node1 {
|
| H A D | reuse-label1.dts | 4 label: node1 {
|
| /netbsd-src/external/bsd/dhcpcd/dist/src/ |
| H A D | route.c | 131 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/sys/dev/microcode/aic7xxx/ |
| H A D | aicasm_symbol.c | 300 symbol_node_t *node1, *node2; in symlist_free() local
302 node1 = SLIST_FIRST(symlist); in symlist_free()
303 while (node1 != NULL) { in symlist_free()
304 node2 = SLIST_NEXT(node1, links); in symlist_free()
305 free(node1); in symlist_free()
306 node1 = node2; in symlist_free()
|
| /netbsd-src/external/gpl3/gcc.old/dist/gcc/lto/ |
| H A D | lto-partition.c | 135 symtab_node *node1; in add_symbol_to_partition_1() local
210 for (node1 = node->same_comdat_group; in add_symbol_to_partition_1()
211 node1 != node; node1 = node1->same_comdat_group) in add_symbol_to_partition_1()
214 bool added = add_symbol_to_partition_1 (part, node1); in add_symbol_to_partition_1()
250 symtab_node *node1; in add_symbol_to_partition() local
256 while ((node1 = contained_in_symbol (node)) != node) in add_symbol_to_partition()
257 node = node1; in add_symbol_to_partition()
|
| /netbsd-src/external/gpl3/gcc/dist/gcc/lto/ |
| H A D | lto-partition.cc | 135 symtab_node *node1; in add_symbol_to_partition_1() local
210 for (node1 = node->same_comdat_group; in add_symbol_to_partition_1()
211 node1 != node; node1 = node1->same_comdat_group) in add_symbol_to_partition_1()
214 bool added = add_symbol_to_partition_1 (part, node1); in add_symbol_to_partition_1()
250 symtab_node *node1; in add_symbol_to_partition() local
256 while ((node1 = contained_in_symbol (node)) != node) in add_symbol_to_partition()
257 node = node1; in add_symbol_to_partition()
|
| /netbsd-src/crypto/external/bsd/heimdal/dist/lib/roken/ |
| H A D | tsearch-test.c | 39 node_compare(const void *node1, const void *node2) in node_compare() argument
41 return strcmp(((const struct node *) node1)->string, in node_compare()
|
| /netbsd-src/external/zlib/pigz/dist/zopfli/ |
| H A D | katajainen.c | 149 Node* node1 = GetFreeNode(0, maxbits, pool); in InitLists() local
151 InitNode(leaves[1].weight, 2, 0, node1); in InitLists()
154 lists[i][1] = node1; in InitLists()
|
| /netbsd-src/external/cddl/osnet/dist/uts/common/fs/zfs/ |
| H A D | zfs_fuid.c | 74 const fuid_domain_t *node1 = arg1; 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()
90 const fuid_domain_t *node1 = arg1; 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 D | CallStack.cc | 1222 CallStackNode *node1 = (CallStackNode *) stack1; 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()
1232 node1 = node1->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 D | CallStack.cc | 1222 CallStackNode *node1 = (CallStackNode *) stack1; 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()
1232 node1 = node1->ancestor; in compare()
1235 if (node1 == NULL && node2 != NULL) in compare()
1237 else if (node1 != NULL && node2 == NULL) in compare()
|