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

/freebsd-10.0-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-10.0-release/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.0-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-10.0-release/contrib/llvm/include/llvm/CodeGen/PBQP/
H A DGraph.h86 NodeItr node1, node2; member in class:PBQP::Graph::EdgeEntry
92 EdgeEntry(NodeItr node1, NodeItr node2, const Matrix &costs) argument
93 : node1(node1), node2(node2), costs(costs) {}
95 NodeItr getNode2() const { return node2; }
/freebsd-10.0-release/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.0-release/contrib/llvm/lib/CodeGen/
H A DRegAllocPBQP.cpp374 PBQP::Graph::NodeItr node2 = p->getNodeForVReg(src); local
375 PBQP::Graph::EdgeItr edge = g.findEdge(node1, node2);
377 edge = g.addEdge(node1, node2, PBQP::Matrix(allowed1->size() + 1,
381 if (g.getEdgeNode1(edge) == node2) {
382 std::swap(node1, node2);
/freebsd-10.0-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);
H A Ddnode.c39 static int free_range_compar(const void *node1, const void *node2);
320 free_range_compar(const void *node1, const void *node2) argument
323 const free_range_t *rp2 = node2;
/freebsd-10.0-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-10.0-release/contrib/libarchive/libarchive/
H A Darchive_ppmd7.c215 CPpmd7_Node *node2 = NODE(n) + nu; local
216 nu += node2->NU;
217 if (node2->Stamp != 0 || nu >= 0x10000)
219 NODE(node2->Prev)->Next = node2->Next;
220 NODE(node2->Next)->Prev = node2->Prev;
/freebsd-10.0-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-10.0-release/contrib/subversion/subversion/libsvn_fs_base/
H A Ddag.h588 dag_node_t *node2,
H A Ddag.c1631 dag_node_t *node2,
1645 SVN_ERR(svn_fs_bdb__get_node_revision(&noderev2, node2->fs, node2->id,
1620 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
H A Dtree.c1387 dag_node_t *node1, *node2;
1390 SVN_ERR(get_dag(&node2, args->root2, args->path2, trail, trail->pool));
1392 node1, node2, trail, trail->pool);
3956 dag_node_t *node1, *node2;
3959 SVN_ERR(get_dag(&node2, args->root2, args->path2, trail, trail->pool));
3961 node1, node2, trail, trail->pool);
1380 dag_node_t *node1, *node2; local
3944 dag_node_t *node1, *node2; local
/freebsd-10.0-release/contrib/subversion/subversion/libsvn_fs_fs/
H A Ddag.h558 dag_node_t *node2);
H A Ddag.c1251 dag_node_t *node2)
1262 SVN_ERR(get_node_revision(&noderev2, node2));
1242 svn_fs_fs__dag_things_different(svn_boolean_t *props_changed, svn_boolean_t *contents_changed, dag_node_t *node1, dag_node_t *node2) argument
H A Dtree.c1517 dag_node_t *node1, *node2;
1526 SVN_ERR(get_dag(&node2, root2, path2, TRUE, pool));
1528 node1, node2);
3061 dag_node_t *node1, *node2;
3085 SVN_ERR(get_dag(&node2, root2, path2, TRUE, pool));
3087 node1, node2);
1510 dag_node_t *node1, *node2; local
3051 dag_node_t *node1, *node2; local
/freebsd-10.0-release/contrib/llvm/lib/Target/R600/
H A DAMDILCFGStructurizer.cpp2398 DomTreeNodeT *node2 = postDomTree->getNode(blk2); local
2404 if (node2 == NULL && blk2->succ_size() == 1) {
2408 if (node1 == NULL || node2 == NULL) {
2414 if (postDomTree->dominates(node1, node2)) {

Completed in 392 milliseconds