Searched refs:node2 (Results 1 - 15 of 15) sorted by relevance

/freebsd-9.3-release/contrib/gcc/
H A Dipa.c33 struct cgraph_node *node, *node2; local
50 node2 = node;
55 while (node2)
57 while (node2->aux != &last)
59 edge = node2->aux;
61 node2->aux = edge->next_caller;
63 node2->aux = &last;
70 stack[stack_size++] = node2;
71 node2 = edge->caller;
75 if (node2
[all...]
H A Dcgraph.c543 struct cgraph_node **node2 = &node->origin->nested; local
545 while (*node2 != node)
546 node2 = &(*node2)->next_nested;
547 *node2 = node->next_nested;
1134 struct cgraph_node **node2 = &node->origin->nested; local
1137 while (*node2 != node)
1138 node2 = &(*node2)->next_nested;
1139 *node2
[all...]
H A Dvar-tracking.c1126 location_chain node, node2; local
1144 node2 = dst->var_part[j].loc_chain; node && node2;
1145 node = node->next, node2 = node2->next)
1147 if (!((REG_P (node2->loc)
1149 && REGNO (node2->loc) == REGNO (node->loc))
1150 || rtx_equal_p (node2->loc, node->loc)))
1153 if (node || node2)
/freebsd-9.3-release/sys/gnu/fs/xfs/
H A Dxfs_da_btree.c508 xfs_da_intnode_t *node1, *node2, *tmpnode; local
514 node2 = blk2->bp->data;
519 if ((be16_to_cpu(node1->hdr.count) > 0) && (be16_to_cpu(node2->hdr.count) > 0) &&
520 ((be32_to_cpu(node2->btree[0].hashval) < be32_to_cpu(node1->btree[0].hashval)) ||
521 (be32_to_cpu(node2->btree[be16_to_cpu(node2->hdr.count)-1].hashval) <
524 node1 = node2;
525 node2 = tmpnode;
528 ASSERT(be16_to_cpu(node2->hdr.info.magic) == XFS_DA_NODE_MAGIC);
529 count = (be16_to_cpu(node1->hdr.count) - be16_to_cpu(node2
1354 xfs_da_intnode_t *node1, *node2; local
[all...]
/freebsd-9.3-release/contrib/one-true-awk/
H A Dparse.c60 Node *node2(int a, Node *b, Node *c) function
109 x = node2(a,b,c);
145 x = node2(a,b,c);
H A Dproto.h73 extern Node *node2(int, Node *, Node *);
/freebsd-9.3-release/contrib/llvm/include/llvm/CodeGen/PBQP/
H A DGraph.h70 NodeId node1, node2; member in class:PBQP::Graph::EdgeEntry
76 EdgeEntry(NodeId node1, NodeId node2, const Matrix &costs) argument
77 : node1(node1), node2(node2), costs(costs) {}
79 NodeId getNode2() const { return node2; }
/freebsd-9.3-release/sys/netgraph/
H A Dng_base.c231 node_p node2, const char *name2);
673 node_p node2 = NULL; local
677 NG_IDHASH_FIND(node->nd_ID, node2); /* already taken? */
678 if ((node->nd_ID != 0) && (node2 == NULL)) {
853 node_p node2; local
876 LIST_FOREACH(node2, &V_ng_name_hash[hash], nd_nodes)
877 if (NG_NODE_IS_VALID(node2) &&
878 (strcmp(NG_NODE_NAME(node2), name) == 0)) {
980 node_p node, node2; local
989 LIST_FOREACH_SAFE(node, &V_ng_name_hash[i], nd_nodes, node2) {
1011 node_p node, node2; local
1476 ng_con_nodes(item_p item, node_p node, const char *name, node_p node2, const char *name2) argument
1541 node_p node2; local
2543 node_p node2; local
[all...]
/freebsd-9.3-release/contrib/llvm/lib/CodeGen/
H A DRegAllocPBQP.cpp373 PBQP::Graph::NodeId node2 = p->getNodeForVReg(src); local
374 PBQP::Graph::EdgeId edge = g.findEdge(node1, node2);
376 edge = g.addEdge(node1, node2, PBQP::Matrix(allowed1->size() + 1,
380 if (g.getEdgeNode1(edge) == node2) {
381 std::swap(node1, node2);
/freebsd-9.3-release/sys/cddl/contrib/opensolaris/uts/common/fs/zfs/
H A Dzfs_fuid.c75 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);
H A Dsa.c250 const sa_lot_t *node2 = arg2; local
252 if (node1->lot_num > node2->lot_num)
254 else if (node1->lot_num < node2->lot_num)
263 const sa_lot_t *node2 = arg2; local
265 if (node1->lot_hash > node2->lot_hash)
267 if (node1->lot_hash < node2->lot_hash)
269 if (node1->lot_instance > node2->lot_instance)
271 if (node1->lot_instance < node2->lot_instance)
H A Ddsl_deleg.c388 const perm_set_t *node2 = arg2; local
391 val = strcmp(node1->p_setname, node2->p_setname);
/freebsd-9.3-release/usr.sbin/bsdconfig/dot/
H A Ddot120 local node1="$1" node2="$2"
122 shift 2 # node1 node2
124 printf '\t\t"%s" -> "%s"' "$node1" "$node2"
/freebsd-9.3-release/sys/dev/aic7xxx/aicasm/
H A Daicasm_symbol.c299 symbol_node_t *node1, *node2; local
303 node2 = SLIST_NEXT(node1, links);
305 node1 = node2;
/freebsd-9.3-release/contrib/cvs/src/
H A Dhash.c395 Node **node2 = (Node **) elem2; local
396 return client_comp (*node1, *node2);

Completed in 209 milliseconds