Searched refs:node1 (Results 1 - 21 of 21) sorted by relevance

/freebsd-10-stable/contrib/libyaml/tests/
H A Drun-dumper.c82 yaml_node_t *node1 = yaml_document_get_node(document1, index1); local
86 assert(node1);
89 if (node1->type != node2->type)
92 if (strcmp((char *)node1->tag, (char *)node2->tag) != 0) return 0;
94 switch (node1->type) {
96 if (node1->data.scalar.length != node2->data.scalar.length)
98 if (strncmp((char *)node1->data.scalar.value, (char *)node2->data.scalar.value,
99 node1->data.scalar.length) != 0) return 0;
102 if ((node1->data.sequence.items.top - node1
[all...]
/freebsd-10-stable/contrib/one-true-awk/
H A Dparse.c50 Node *node1(int a, Node *b) function
100 x = node1(a,b);
136 x = node1(a,b);
174 x = node1(0, (Node *) a);
H A Dproto.h72 extern Node *node1(int, 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) {}
78 NodeId getNode1() const { return node1; }
/freebsd-10-stable/sys/dev/aic7xxx/aicasm/
H A Daicasm_symbol.c299 symbol_node_t *node1, *node2; local
301 node1 = SLIST_FIRST(symlist);
302 while (node1 != NULL) {
303 node2 = SLIST_NEXT(node1, links);
304 free(node1);
305 node1 = node2;
/freebsd-10-stable/contrib/gcc/
H A Dipa-inline.c1023 struct cgraph_node *node1; local
1026 for (node1 = node->callers->caller;
1027 node1->callers && !node1->callers->inline_failed
1028 && ok; node1 = node1->callers->caller)
1029 if (node1->callers->next_caller || node1->needed)
H A Dipa-cp.c1005 struct cgraph_node *node, *node1 = NULL; local
1054 node1 =
1058 if (node1 == NULL)
1063 ipcp_cloned_create (node, node1);
1073 ipcp_propagate_const (node1, i, cvalue, type);
/freebsd-10-stable/sys/cddl/contrib/opensolaris/uts/common/fs/zfs/
H A Dzfs_fuid.c74 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 Dsa.c245 const sa_lot_t *node1 = arg1; local
248 if (node1->lot_num > node2->lot_num)
250 else if (node1->lot_num < node2->lot_num)
258 const sa_lot_t *node1 = arg1; 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.c387 const perm_set_t *node1 = arg1; local
391 val = strcmp(node1->p_setname, node2->p_setname);
/freebsd-10-stable/contrib/llvm/lib/CodeGen/
H A DRegAllocPBQP.cpp372 PBQP::Graph::NodeId node1 = p->getNodeForVReg(dst); local
374 PBQP::Graph::EdgeId edge = g.findEdge(node1, node2);
376 edge = g.addEdge(node1, node2, PBQP::Matrix(allowed1->size() + 1,
381 std::swap(node1, node2);
/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/subversion/subversion/libsvn_fs_fs/
H A Ddag.h563 dag_node_t *node1,
H A Ddag.c1310 dag_node_t *node1,
1323 SVN_ERR(get_node_revision(&noderev1, node1));
1334 svn_fs_t *fs = svn_fs_fs__dag_get_fs(node1);
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;
1652 SVN_ERR(get_dag(&node1, root1, path1, pool));
1655 node1, node2, strict, pool);
3193 dag_node_t *node1, *node2;
3216 SVN_ERR(get_dag(&node1, root1, path1, 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.h549 dag_node_t *node1,
H A Ddag.c1273 dag_node_t *node1,
1287 fs = svn_fs_x__dag_get_fs(node1);
1290 SVN_ERR(get_node_revision(&noderev1, node1));
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;
1649 SVN_ERR(get_dag(&node1, root1, path1, subpool));
1651 SVN_ERR(svn_fs_x__dag_things_different(changed_p, NULL, node1, node2,
3238 dag_node_t *node1, *node2;
3262 SVN_ERR(get_dag(&node1, root1, path1, 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.h587 dag_node_t *node1,
H A Dtree.c1428 dag_node_t *node1, *node2;
1431 SVN_ERR(get_dag(&node1, args->root1, args->path1, trail, trail->pool));
1434 node1, node2, trail, trail->pool));
1441 SVN_ERR(svn_fs_base__dag_get_proplist(&proplist1, node1,
4034 dag_node_t *node1, *node2;
4039 SVN_ERR(get_dag(&node1, args->root1, args->path1, trail, trail->pool));
4042 node1, node2, trail, trail->pool));
4052 node1, trail, trail->pool));
4063 node1, trail, trail->pool));
4075 SVN_ERR(svn_fs_base__dag_get_contents(&stream1, node1, trai
1421 dag_node_t *node1, *node2; local
4022 dag_node_t *node1, *node2; local
[all...]
H A Ddag.c1643 dag_node_t *node1,
1656 SVN_ERR(svn_fs_bdb__get_node_revision(&noderev1, node1->fs, node1->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 315 milliseconds