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

/freebsd-10.0-release/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.0-release/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.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) {}
94 NodeItr getNode1() const { return node1; }
/freebsd-10.0-release/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.0-release/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.0-release/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.c249 const sa_lot_t *node1 = arg1; local
252 if (node1->lot_num > node2->lot_num)
254 else if (node1->lot_num < node2->lot_num)
262 const sa_lot_t *node1 = arg1; 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.c387 const perm_set_t *node1 = arg1; 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
322 const free_range_t *rp1 = node1;
/freebsd-10.0-release/contrib/llvm/lib/CodeGen/
H A DRegAllocPBQP.cpp373 PBQP::Graph::NodeItr node1 = p->getNodeForVReg(dst); local
375 PBQP::Graph::EdgeItr edge = g.findEdge(node1, node2);
377 edge = g.addEdge(node1, node2, PBQP::Matrix(allowed1->size() + 1,
382 std::swap(node1, 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/subversion/subversion/libsvn_fs_base/
H A Ddag.h587 dag_node_t *node1,
H A Ddag.c1630 dag_node_t *node1,
1643 SVN_ERR(svn_fs_bdb__get_node_revision(&noderev1, node1->fs, node1->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;
1389 SVN_ERR(get_dag(&node1, args->root1, args->path1, trail, trail->pool));
1392 node1, node2, trail, trail->pool);
3956 dag_node_t *node1, *node2;
3958 SVN_ERR(get_dag(&node1, args->root1, args->path1, 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.h557 dag_node_t *node1,
H A Ddag.c1250 dag_node_t *node1,
1261 SVN_ERR(get_node_revision(&noderev1, node1));
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;
1525 SVN_ERR(get_dag(&node1, root1, path1, TRUE, pool));
1528 node1, node2);
3061 dag_node_t *node1, *node2;
3084 SVN_ERR(get_dag(&node1, root1, path1, 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.cpp2397 DomTreeNodeT *node1 = postDomTree->getNode(blk1); local
2401 if (node1 == NULL && blk1->succ_size() == 1) {
2408 if (node1 == NULL || node2 == NULL) {
2412 node1 = node1->getIDom();
2413 while (node1) {
2414 if (postDomTree->dominates(node1, node2)) {
2415 return node1->getBlock();
2417 node1 = node1
[all...]

Completed in 401 milliseconds