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

/freebsd-10-stable/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-10-stable/contrib/libyaml/tests/
H A Drun-dumper.c83 yaml_node_t *node2 = yaml_document_get_node(document2, index2); local
87 assert(node2);
89 if (node1->type != node2->type)
92 if (strcmp((char *)node1->tag, (char *)node2->tag) != 0) return 0;
96 if (node1->data.scalar.length != node2->data.scalar.length)
98 if (strncmp((char *)node1->data.scalar.value, (char *)node2->data.scalar.value,
103 (node2->data.sequence.items.top - node2->data.sequence.items.start))
107 document2, node2->data.sequence.items.start[k])) return 0;
112 (node2
[all...]
/freebsd-10-stable/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-10-stable/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-10-stable/sys/netgraph/
H A Dng_base.c226 node_p node2, const char *name2);
668 node_p node2 = NULL; local
672 NG_IDHASH_FIND(node->nd_ID, node2); /* already taken? */
673 if ((node->nd_ID != 0) && (node2 == NULL)) {
848 node_p node2; local
871 LIST_FOREACH(node2, &V_ng_name_hash[hash], nd_nodes)
872 if (NG_NODE_IS_VALID(node2) &&
873 (strcmp(NG_NODE_NAME(node2), name) == 0)) {
975 node_p node, node2; local
984 LIST_FOREACH_SAFE(node, &V_ng_name_hash[i], nd_nodes, node2) {
1006 node_p node, node2; local
1471 ng_con_nodes(item_p item, node_p node, const char *name, node_p node2, const char *name2) argument
1536 node_p node2; local
2538 node_p node2; local
[all...]
/freebsd-10-stable/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-10-stable/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.c246 const sa_lot_t *node2 = arg2; local
248 if (node1->lot_num > node2->lot_num)
250 else if (node1->lot_num < node2->lot_num)
259 const sa_lot_t *node2 = arg2; local
261 if (node1->lot_hash > node2->lot_hash)
263 if (node1->lot_hash < node2->lot_hash)
265 if (node1->lot_instance > node2->lot_instance)
267 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-10-stable/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-10-stable/contrib/libarchive/libarchive/
H A Darchive_ppmd7.c220 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;
H A Darchive_ppmd8.c170 CPpmd8_Node *node2; local
173 while ((node2 = node + node->NU)->Stamp == EMPTY_NODE)
175 node->NU += node2->NU;
176 node2->NU = 0;
/freebsd-10-stable/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-10-stable/contrib/subversion/subversion/libsvn_fs_fs/
H A Ddag.h564 dag_node_t *node2,
H A Ddag.c1311 dag_node_t *node2,
1324 SVN_ERR(get_node_revision(&noderev2, node2));
1302 svn_fs_fs__dag_things_different(svn_boolean_t *props_changed, svn_boolean_t *contents_changed, dag_node_t *node1, dag_node_t *node2, svn_boolean_t strict, apr_pool_t *pool) argument
H A Dtree.c1644 dag_node_t *node1, *node2;
1653 SVN_ERR(get_dag(&node2, root2, path2, pool));
1655 node1, node2, strict, pool);
3193 dag_node_t *node1, *node2;
3217 SVN_ERR(get_dag(&node2, root2, path2, pool));
3219 node1, node2, strict, pool);
1637 dag_node_t *node1, *node2; local
3183 dag_node_t *node1, *node2; local
/freebsd-10-stable/contrib/subversion/subversion/libsvn_fs_x/
H A Ddag.h550 dag_node_t *node2,
H A Ddag.c1274 dag_node_t *node2,
1291 SVN_ERR(get_node_revision(&noderev2, node2));
1265 svn_fs_x__dag_things_different(svn_boolean_t *props_changed, svn_boolean_t *contents_changed, dag_node_t *node1, dag_node_t *node2, svn_boolean_t strict, apr_pool_t *scratch_pool) argument
H A Dtree.c1640 dag_node_t *node1, *node2;
1650 SVN_ERR(get_dag(&node2, root2, path2, subpool));
1651 SVN_ERR(svn_fs_x__dag_things_different(changed_p, NULL, node1, node2,
3238 dag_node_t *node1, *node2;
3263 SVN_ERR(get_dag(&node2, root2, path2, subpool));
3264 SVN_ERR(svn_fs_x__dag_things_different(NULL, changed_p, node1, node2,
1633 dag_node_t *node1, *node2; local
3228 dag_node_t *node1, *node2; local
/freebsd-10-stable/contrib/subversion/subversion/libsvn_fs_base/
H A Ddag.h588 dag_node_t *node2,
H A Dtree.c1428 dag_node_t *node1, *node2;
1432 SVN_ERR(get_dag(&node2, args->root2, args->path2, trail, trail->pool));
1434 node1, node2, trail, trail->pool));
1443 SVN_ERR(svn_fs_base__dag_get_proplist(&proplist2, node2,
4034 dag_node_t *node1, *node2;
4040 SVN_ERR(get_dag(&node2, args->root2, args->path2, trail, trail->pool));
4042 node1, node2, trail, trail->pool));
4054 node2, trail, trail->pool));
4065 node2, trail, trail->pool));
4076 SVN_ERR(svn_fs_base__dag_get_contents(&stream2, node2, trai
1421 dag_node_t *node1, *node2; local
4022 dag_node_t *node1, *node2; local
[all...]
H A Ddag.c1644 dag_node_t *node2,
1658 SVN_ERR(svn_fs_bdb__get_node_revision(&noderev2, node2->fs, node2->id,
1633 svn_fs_base__things_different(svn_boolean_t *props_changed, svn_boolean_t *contents_changed, dag_node_t *node1, dag_node_t *node2, trail_t *trail, apr_pool_t *pool) argument

Completed in 402 milliseconds