/netbsd-current/external/gpl3/gcc.old/dist/libobjc/ |
H A D | hash.c | 125 node_ptr node1 = (*cachep)->node_table[indx]; local 126 while (node1) 128 assert (node1->key != key); 129 node1 = node1->next; 149 node_ptr node1 = NULL; local 158 while ((node1 = objc_hash_next (*cachep, node1))) 159 objc_hash_add (&new, node1->key, node1 [all...] |
/netbsd-current/external/gpl3/gcc/dist/libobjc/ |
H A D | hash.c | 125 node_ptr node1 = (*cachep)->node_table[indx]; local 126 while (node1) 128 assert (node1->key != key); 129 node1 = node1->next; 149 node_ptr node1 = NULL; local 158 while ((node1 = objc_hash_next (*cachep, node1))) 159 objc_hash_add (&new, node1->key, node1 [all...] |
/netbsd-current/crypto/external/bsd/heimdal/dist/lib/roken/ |
H A D | tsearch-test.c | 39 node_compare(const void *node1, const void *node2) argument 41 return strcmp(((const struct node *) node1)->string,
|
/netbsd-current/external/gpl3/gcc.old/dist/gcc/ |
H A D | cgraph.h | 2738 symtab_node *node1 = next; local 2740 for (; node1; node1 = node1->next) 2741 if (node1->definition) 2742 return node1; 2931 symtab_node *node1 = node->next; local 2932 for (; node1; node1 = node1 2961 symtab_node *node1 = node->next; local 2994 symtab_node *node1 = node->next; local 3026 symtab_node *node1 = node->next; local 3056 symtab_node *node1 = node->next; local 3081 symtab_node *node1 = node->next; local [all...] |
/netbsd-current/external/gpl3/gcc/dist/gcc/ |
H A D | cgraph.h | 2717 symtab_node *node1 = next; 2719 for (; node1; node1 = node1->next) 2720 if (node1->definition) 2721 return node1; 2910 symtab_node *node1 = node->next; 2911 for (; node1; node1 = node1 2703 symtab_node *node1 = next; local 2896 symtab_node *node1 = node->next; local 2926 symtab_node *node1 = node->next; local 2959 symtab_node *node1 = node->next; local 2991 symtab_node *node1 = node->next; local 3021 symtab_node *node1 = node->next; local 3046 symtab_node *node1 = node->next; local [all...] |
H A D | tree-vect-slp-patterns.cc | 353 vect_detect_pair_op (slp_tree node1, slp_tree node2, lane_permutation_t &lanes, argument 358 if (vect_match_expression_p (node1, MINUS_EXPR) 362 else if (vect_match_expression_p (node1, PLUS_EXPR) 366 else if (vect_match_expression_p (node1, PLUS_EXPR) 369 else if (vect_match_expression_p (node1, MULT_EXPR) 377 auto l0node = SLP_TREE_CHILDREN (node1); 385 ops->safe_push (node1);
|
H A D | splay-tree-utils.h | 461 static int compare_nodes (node_type node1, node_type node2);
|
/netbsd-current/external/apache2/llvm/dist/llvm/lib/Target/AArch64/ |
H A D | AArch64PBQPRegAlloc.cpp | 173 PBQPRAGraph::NodeId node1 = G.getMetadata().getNodeIdForVReg(Rd); local 177 &G.getNodeMetadata(node1).getAllowedRegs(); 181 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2); 202 G.addEdge(node1, node2, std::move(costs)); 207 std::swap(node1, node2); 260 PBQPRAGraph::NodeId node1 = G.getMetadata().getNodeIdForVReg(Rd); local 271 &G.getNodeMetadata(node1).getAllowedRegs(); 277 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2); 284 std::swap(node1, node2);
|
/netbsd-current/external/bsd/dhcpcd/dist/src/ |
H A D | route.c | 131 rt_compare_os(__unused void *context, const void *node1, const void *node2) argument 133 const struct rt *rt1 = node1, *rt2 = node2; 148 rt_compare_list(__unused void *context, const void *node1, const void *node2) argument 150 const struct rt *rt1 = node1, *rt2 = node2; 160 rt_compare_proto(void *context, const void *node1, const void *node2) argument 162 const struct rt *rt1 = node1, *rt2 = node2; 225 rt_compare_free(__unused void *context, const void *node1, const void *node2) argument 228 return node1 == node2 ? 0 : node1 < node2 ? -1 : 1;
|
/netbsd-current/external/historical/nawk/dist/ |
H A D | parse.c | 54 Node *node1(int a, Node *b) function 118 x = node1(a,b); 154 x = node1(a,b); 201 x = node1(0, (Node *) a);
|
H A D | proto.h | 73 extern Node *node1(int, Node *);
|
/netbsd-current/external/zlib/pigz/dist/zopfli/ |
H A D | katajainen.c | 149 Node* node1 = GetFreeNode(0, maxbits, pool); local 151 InitNode(leaves[1].weight, 2, 0, node1); 154 lists[i][1] = node1;
|
/netbsd-current/sys/dev/microcode/aic7xxx/ |
H A D | aicasm_symbol.c | 300 symbol_node_t *node1, *node2; local 302 node1 = SLIST_FIRST(symlist); 303 while (node1 != NULL) { 304 node2 = SLIST_NEXT(node1, links); 305 free(node1); 306 node1 = node2;
|
/netbsd-current/external/gpl3/gcc.old/dist/gcc/lto/ |
H A D | lto-partition.c | 135 symtab_node *node1; local 210 for (node1 = node->same_comdat_group; 211 node1 != node; node1 = node1->same_comdat_group) 214 bool added = add_symbol_to_partition_1 (part, node1); 250 symtab_node *node1; local 256 while ((node1 = contained_in_symbol (node)) != node) 257 node = node1;
|
/netbsd-current/external/gpl3/gcc/dist/gcc/lto/ |
H A D | lto-partition.cc | 135 symtab_node *node1; local 210 for (node1 = node->same_comdat_group; 211 node1 != node; node1 = node1->same_comdat_group) 214 bool added = add_symbol_to_partition_1 (part, node1); 250 symtab_node *node1; local 256 while ((node1 = contained_in_symbol (node)) != node) 257 node = node1;
|
/netbsd-current/usr.sbin/ldpd/ |
H A D | label.c | 65 labels_compare(void *context, const void *node1, const void *node2) argument 67 const struct label *l1 = node1, *l2 = node2;
|
/netbsd-current/external/gpl2/dtc/dist/tests/ |
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))
|
/netbsd-current/external/cddl/osnet/dist/uts/common/fs/zfs/ |
H A D | zfs_fuid.c | 74 const fuid_domain_t *node1 = arg1; local 77 if (node1->f_idx < node2->f_idx) 79 else if (node1->f_idx > node2->f_idx) 90 const fuid_domain_t *node1 = arg1; local 94 val = strcmp(node1->f_ksid->kd_name, node2->f_ksid->kd_name);
|
H A D | sa.c | 246 const sa_lot_t *node1 = arg1; local 249 if (node1->lot_num > node2->lot_num) 251 else if (node1->lot_num < node2->lot_num) 259 const sa_lot_t *node1 = arg1; local 262 if (node1->lot_hash > node2->lot_hash) 264 if (node1->lot_hash < node2->lot_hash) 266 if (node1->lot_instance > node2->lot_instance) 268 if (node1->lot_instance < node2->lot_instance)
|
/netbsd-current/external/gpl3/binutils/dist/gprofng/src/ |
H A D | CallStack.cc | 1222 CallStackNode *node1 = (CallStackNode *) stack1; 1224 while (node1 != NULL && node2 != NULL) 1228 if (node1->instr->id < node2->instr->id) 1230 else if (node1->instr->id > node2->instr->id) 1232 node1 = node1->ancestor; 1235 if (node1 == NULL && node2 != NULL) 1237 else if (node1 != NULL && node2 == NULL)
|
/netbsd-current/external/gpl3/binutils.old/dist/gprofng/src/ |
H A D | CallStack.cc | 1222 CallStackNode *node1 = (CallStackNode *) stack1; 1224 while (node1 != NULL && node2 != NULL) 1228 if (node1->instr->id < node2->instr->id) 1230 else if (node1->instr->id > node2->instr->id) 1232 node1 = node1->ancestor; 1235 if (node1 == NULL && node2 != NULL) 1237 else if (node1 != NULL && node2 == NULL)
|
/netbsd-current/external/gpl2/xcvs/dist/src/ |
H A D | hash.c | 440 Node **node1 = (Node **) elem1; local 442 return client_comp (*node1, *node2);
|
/netbsd-current/external/mit/isl/dist/include/isl/ |
H A D | schedule_node.h | 29 isl_bool isl_schedule_node_is_equal(__isl_keep isl_schedule_node *node1, 86 __isl_keep isl_schedule_node *node1,
|
/netbsd-current/external/mit/isl/dist/ |
H A D | isl_schedule_node.c | 245 /* Do "node1" and "node2" point to the same position in the same 248 isl_bool isl_schedule_node_is_equal(__isl_keep isl_schedule_node *node1, argument 254 if (!node1 || !node2) 256 if (node1 == node2) 258 if (node1->schedule != node2->schedule) 261 n1 = isl_schedule_node_get_tree_depth(node1); 268 if (node1->child_pos[i] != node2->child_pos[i]) 4885 __isl_keep isl_schedule_node *node1, 4891 n1 = isl_schedule_node_get_tree_depth(node1); 4895 if (node1 4884 isl_schedule_node_get_shared_ancestor( __isl_keep isl_schedule_node *node1, __isl_keep isl_schedule_node *node2) argument [all...] |
H A D | isl_scheduler_clustering.c | 1246 /* Swap the schedule of "node1" and "node2". 1251 static void swap_sched(struct isl_sched_node *node1, argument 1257 sched = node1->sched; 1258 node1->sched = node2->sched; 1261 sched_map = node1->sched_map; 1262 node1->sched_map = node2->sched_map;
|