HomeSort by: relevance | last modified time | path
    Searched refs:node2 (Results 1 - 25 of 68) sorted by relevancy

1 2 3

  /src/crypto/external/bsd/heimdal/dist/lib/roken/
tsearch-test.c 39 node_compare(const void *node1, const void *node2)
42 ((const struct node *) node2)->string);
  /src/external/gpl3/binutils/dist/include/
doubly-linked-list.h 238 LTYPE##_swap (LWRAPPERTYPE *wrapper, LTYPE *node1, LTYPE *node2)
243 LTYPE##_swap (LWRAPPERTYPE *wrapper, LTYPE *node1, LTYPE *node2) \
247 LTYPE *prev2 = node2->prev; \
248 LTYPE *next2 = node2->next; \
251 prev1->next = node2; \
253 wrapper->first = node2; \
260 next1->prev = node2; \
262 wrapper->last = node2; \
270 node1->next = node2->next; \
271 node2->next = temp;
    [all...]
  /src/external/gpl3/binutils.old/dist/include/
doubly-linked-list.h 238 LTYPE##_swap (LWRAPPERTYPE *wrapper, LTYPE *node1, LTYPE *node2)
243 LTYPE##_swap (LWRAPPERTYPE *wrapper, LTYPE *node1, LTYPE *node2) \
247 LTYPE *prev2 = node2->prev; \
248 LTYPE *next2 = node2->next; \
251 prev1->next = node2; \
253 wrapper->first = node2; \
260 next1->prev = node2; \
262 wrapper->last = node2; \
270 node1->next = node2->next; \
271 node2->next = temp;
    [all...]
  /src/external/gpl3/gdb/dist/include/
doubly-linked-list.h 238 LTYPE##_swap (LWRAPPERTYPE *wrapper, LTYPE *node1, LTYPE *node2)
243 LTYPE##_swap (LWRAPPERTYPE *wrapper, LTYPE *node1, LTYPE *node2) \
247 LTYPE *prev2 = node2->prev; \
248 LTYPE *next2 = node2->next; \
251 prev1->next = node2; \
253 wrapper->first = node2; \
260 next1->prev = node2; \
262 wrapper->last = node2; \
270 node1->next = node2->next; \
271 node2->next = temp;
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Target/AArch64/
AArch64PBQPRegAlloc.cpp 174 PBQPRAGraph::NodeId node2 = G.getMetadata().getNodeIdForVReg(Ra); local
179 &G.getNodeMetadata(node2).getAllowedRegs();
181 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2);
202 G.addEdge(node1, node2, std::move(costs));
206 if (G.getEdgeNode1Id(edge) == node2) {
207 std::swap(node1, node2);
273 PBQPRAGraph::NodeId node2 = G.getMetadata().getNodeIdForVReg(r); local
275 &G.getNodeMetadata(node2).getAllowedRegs();
277 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2);
283 if (G.getEdgeNode1Id(edge) == node2) {
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
ipa-utils.cc 278 struct cgraph_node *node, *node2; local
312 node2 = NULL;
313 while (stack[stack_size].edge && !node2)
316 node2 = edge->caller;
324 node2 = NULL;
328 ref) && !node2;
332 node2 = dyn_cast <cgraph_node *> (ref->referring);
334 if (!node2)
336 if (!node2->aux)
338 stack[++stack_size].node = node2;
    [all...]
symbol-summary.h 242 static void symtab_duplication (cgraph_node *node, cgraph_node *node2,
308 cgraph_node *node2, void *data)
314 summary->duplicate (node, node2, v, summary->get_create (node2));
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);
tree-vect-slp-patterns.cc 333 NODE2 in parallel and returns the pair operation that represents the two
353 vect_detect_pair_op (slp_tree node1, slp_tree node2, lane_permutation_t &lanes,
359 && vect_match_expression_p (node2, PLUS_EXPR)
363 && vect_match_expression_p (node2, MINUS_EXPR)
367 && vect_match_expression_p (node2, PLUS_EXPR))
370 && vect_match_expression_p (node2, MULT_EXPR))
378 auto l1node = SLP_TREE_CHILDREN (node2);
386 ops->safe_push (node2);
  /src/external/gpl2/dtc/dist/tests/
pylibfdt_tests.py 137 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...]
  /src/external/gpl3/gcc/dist/gcc/
ipa-utils.cc 288 struct cgraph_node *node, *node2; local
322 node2 = NULL;
323 while (stack[stack_size].edge && !node2)
326 node2 = edge->caller;
331 ref) && !node2;
335 node2 = dyn_cast <cgraph_node *> (ref->referring);
337 if (!node2)
339 if (!node2->aux)
341 stack[++stack_size].node = node2;
342 stack[stack_size].edge = node2->callers
    [all...]
symbol-summary.h 242 static void symtab_duplication (cgraph_node *node, cgraph_node *node2,
308 cgraph_node *node2, void *data)
314 summary->duplicate (node, node2, v, summary->get_create (node2));
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);
tree-vect-slp-patterns.cc 333 NODE2 in parallel and returns the pair operation that represents the two
353 vect_detect_pair_op (slp_tree node1, slp_tree node2, lane_permutation_t &lanes,
359 && vect_match_expression_p (node2, PLUS_EXPR)
363 && vect_match_expression_p (node2, MINUS_EXPR)
367 && vect_match_expression_p (node2, PLUS_EXPR))
370 && vect_match_expression_p (node2, MULT_EXPR))
378 auto l1node = SLP_TREE_CHILDREN (node2);
386 ops->safe_push (node2);
  /src/external/historical/nawk/dist/
parse.c 64 Node *node2(int a, Node *b, Node *c) function
127 x = node2(a,b,c);
163 x = node2(a,b,c);
  /src/external/bsd/dhcpcd/dist/src/
route.c 140 rt_compare_os(__unused void *context, const void *node1, const void *node2)
142 const struct rt *rt1 = node1, *rt2 = node2;
157 rt_compare_list(__unused void *context, const void *node1, const void *node2)
159 const struct rt *rt1 = node1, *rt2 = node2;
169 rt_compare_proto(void *context, const void *node1, const void *node2)
171 const struct rt *rt1 = node1, *rt2 = node2;
234 rt_compare_free(__unused void *context, const void *node1, const void *node2)
237 return node1 == node2 ? 0 : node1 < node2 ? -1 : 1;
  /src/usr.sbin/ldpd/
label.c 65 labels_compare(void *context, const void *node1, const void *node2)
67 const struct label *l1 = node1, *l2 = node2;
  /src/external/cddl/osnet/dist/uts/common/fs/zfs/
zfs_fuid.c 75 const fuid_domain_t *node2 = arg2; local
77 if (node1->f_idx < node2->f_idx)
79 else if (node1->f_idx > node2->f_idx)
91 const fuid_domain_t *node2 = arg2; local
94 val = strcmp(node1->f_ksid->kd_name, node2->f_ksid->kd_name);
sa.c 247 const sa_lot_t *node2 = arg2; local
249 if (node1->lot_num > node2->lot_num)
251 else if (node1->lot_num < node2->lot_num)
260 const sa_lot_t *node2 = arg2; 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)
  /src/external/bsd/unbound/dist/testcode/
unitmain.c 1187 struct local_zone *node1, *node2; local
1193 node2=(struct local_zone*)rbtree_first(&z2->ztree);
1195 (rbnode_type*)node2 != RBTREE_NULL;
1197 node2=(struct local_zone*)rbtree_next((rbnode_type*)node2)) {
1202 node2->name, node2->namelabs,
1206 (node1->parent == NULL && node2->parent == NULL) ||
1207 (node1->parent != NULL && node2->parent != NULL));
1211 node2->parent->name, node2->parent->namelabs
    [all...]
  /src/external/gpl3/binutils/dist/gprofng/src/
CallStack.cc 1226 CallStackNode *node2 = (CallStackNode *) stack2; local
1227 while (node1 != NULL && node2 != NULL)
1231 if (node1->instr->id < node2->instr->id)
1233 else if (node1->instr->id > node2->instr->id)
1236 node2 = node2->ancestor;
1238 if (node1 == NULL && node2 != NULL)
1240 else if (node1 != NULL && node2 == NULL)
  /src/external/gpl3/binutils.old/dist/gprofng/src/
CallStack.cc 1226 CallStackNode *node2 = (CallStackNode *) stack2; local
1227 while (node1 != NULL && node2 != NULL)
1231 if (node1->instr->id < node2->instr->id)
1233 else if (node1->instr->id > node2->instr->id)
1236 node2 = node2->ancestor;
1238 if (node1 == NULL && node2 != NULL)
1240 else if (node1 != NULL && node2 == NULL)
  /src/external/bsd/libarchive/dist/libarchive/
archive_ppmd7.c 220 CPpmd7_Node *node2 = NODE(n) + nu; local
221 nu += node2->NU;
222 if (node2->Stamp != 0 || nu >= 0x10000)
224 NODE(node2->Prev)->Next = node2->Next;
225 NODE(node2->Next)->Prev = node2->Prev;
  /src/sys/dev/microcode/aic7xxx/
aicasm_symbol.c 300 symbol_node_t *node1, *node2; local
304 node2 = SLIST_NEXT(node1, links);
306 node1 = node2;
  /src/sys/arch/sparc/sparc/
cpu.c 1374 int mid, node2; local
1376 for (node2 = firstchild(findroot());
1377 node2;
1378 node2 = nextsibling(node2)) {
1379 cp = prom_getpropstringA(node2, "device_type",
1384 mid = prom_getpropint(node2, "mid", -1);
1386 node = node2;
  /src/external/gpl2/xcvs/dist/src/
hash.c 441 Node **node2 = (Node **) elem2; local
442 return client_comp (*node1, *node2);
  /src/external/mit/isl/dist/include/isl/
schedule_node.h 30 __isl_keep isl_schedule_node *node2);
87 __isl_keep isl_schedule_node *node2);

Completed in 57 milliseconds

1 2 3