Home
last modified time | relevance | path

Searched refs:nodes (Results 1 – 25 of 341) sorted by relevance

12345678910>>...14

/freebsd-12.1/contrib/subversion/subversion/libsvn_wc/
H A Dwc-queries.sql34 FROM nodes
47 FROM nodes
57 FROM nodes
68 FROM nodes
76 FROM nodes
83 FROM nodes
94 FROM nodes
103 FROM nodes
108 FROM nodes
115 FROM nodes
[all …]
H A Dwc-checks.sql139 FROM nodes
158 FROM nodes
167 FROM nodes
187 FROM nodes
197 FROM nodes n
211 FROM nodes n
212 JOIN nodes p
227 FROM nodes n
235 FROM nodes n
256 FROM nodes s
[all …]
H A Dwc-metadata.sql488 SELECT * FROM nodes AS n
489 WHERE op_depth = (SELECT MAX(op_depth) FROM nodes AS n2
497 SELECT * FROM nodes
501 AFTER INSERT ON nodes
509 AFTER DELETE ON nodes
517 AFTER UPDATE OF checksum ON nodes
639 UPDATE nodes SET presence = "server-excluded" WHERE presence = "absent";
643 UPDATE nodes SET file_external=1 WHERE file_external IS NOT NULL;
690 SELECT l.wc_id, l.local_relpath FROM nodes as l
691 LEFT OUTER JOIN nodes as r
/freebsd-12.1/contrib/ipfilter/
H A Dradix_ipf.c125 nodes[0].addroff = nodes[0].addrkey + masklen;
126 nodes[0].maskoff = nodes[0].maskkey + masklen;
127 nodes[0].parent = &nodes[1];
131 nodes[1].left = &nodes[0];
407 if ((key[nodes[1].offset] & nodes[1].bitmask) == 0) {
410 nodes[1].right = &nodes[0];
1217 rnh->nodes[0].index, GNAME(rnh->nodes[0].parent),
1221 rnh->nodes[1].index, GNAME(rnh->nodes[1].parent),
1225 rnh->nodes[2].index, GNAME(rnh->nodes[2].parent),
1399 stp->nodes[0].parent = &stp->nodes[0];
[all …]
/freebsd-12.1/sys/contrib/ipfilter/netinet/
H A Dradix_ipf.c125 nodes[0].addroff = nodes[0].addrkey + masklen;
126 nodes[0].maskoff = nodes[0].maskkey + masklen;
127 nodes[0].parent = &nodes[1];
131 nodes[1].left = &nodes[0];
407 if ((key[nodes[1].offset] & nodes[1].bitmask) == 0) {
410 nodes[1].right = &nodes[0];
1217 rnh->nodes[0].index, GNAME(rnh->nodes[0].parent),
1221 rnh->nodes[1].index, GNAME(rnh->nodes[1].parent),
1225 rnh->nodes[2].index, GNAME(rnh->nodes[2].parent),
1399 stp->nodes[0].parent = &stp->nodes[0];
[all …]
/freebsd-12.1/contrib/ofed/librdmacm/examples/
H A Dcmtime.c173 us = diff_us(&nodes[c].times[i][1], &nodes[c].times[i][0]); in show_perf()
355 nodes = calloc(sizeof *nodes, connections); in alloc_nodes()
356 if (!nodes) in alloc_nodes()
364 ret = rdma_create_id(channel, &nodes[i].id, &nodes[i], in alloc_nodes()
377 free(nodes); in alloc_nodes()
389 if (nodes[i].id) in cleanup_nodes()
529 if (nodes[i].error) in run_client()
548 if (nodes[i].error) in run_client()
566 if (nodes[i].error) in run_client()
582 if (nodes[i].error) in run_client()
[all …]
H A Dcmatose.c64 struct cmatest_node *nodes; member
375 test.nodes = malloc(sizeof *test.nodes * connections); in alloc_nodes()
376 if (!test.nodes) { in alloc_nodes()
380 memset(test.nodes, 0, sizeof *test.nodes * connections); in alloc_nodes()
383 test.nodes[i].id = i; in alloc_nodes()
396 free(test.nodes); in alloc_nodes()
405 destroy_node(&test.nodes[i]); in destroy_nodes()
406 free(test.nodes); in destroy_nodes()
415 if (!test.nodes[i].connected) in poll_cqs()
559 if (!test.nodes[i].connected) in run_server()
[all …]
H A Dmckey.c65 struct cmatest_node *nodes; member
380 test.nodes = malloc(sizeof *test.nodes * connections); in alloc_nodes()
381 if (!test.nodes) { in alloc_nodes()
385 memset(test.nodes, 0, sizeof *test.nodes * connections); in alloc_nodes()
388 test.nodes[i].id = i; in alloc_nodes()
390 &test.nodes[i], port_space); in alloc_nodes()
398 free(test.nodes); in alloc_nodes()
407 destroy_node(&test.nodes[i]); in destroy_nodes()
408 free(test.nodes); in destroy_nodes()
417 if (!test.nodes[i].connected) in poll_cqs()
[all …]
H A Dudaddy.c62 struct cmatest_node *nodes; member
418 test.nodes = malloc(sizeof *test.nodes * connections); in alloc_nodes()
419 if (!test.nodes) { in alloc_nodes()
423 memset(test.nodes, 0, sizeof *test.nodes * connections); in alloc_nodes()
426 test.nodes[i].id = i; in alloc_nodes()
429 &test.nodes[i].cma_id, in alloc_nodes()
439 free(test.nodes); in alloc_nodes()
448 destroy_node(&test.nodes[i]); in destroy_nodes()
449 free(test.nodes); in destroy_nodes()
471 if (!test.nodes[i].connected) in poll_cqs()
[all …]
/freebsd-12.1/contrib/llvm/lib/CodeGen/
H A DSpillPlacement.cpp221 delete[] nodes; in releaseMemory()
222 nodes = nullptr; in releaseMemory()
232 nodes[n].clear(Threshold); in activate()
244 nodes[n].BiasP = 0; in activate()
314 nodes[ib].addLink(ob, Freq); in addLinks()
315 nodes[ob].addLink(ib, Freq); in addLinks()
325 if (nodes[n].mustSpill()) in scanActiveBundles()
327 if (nodes[n].preferReg()) in scanActiveBundles()
334 if (!nodes[n].update(nodes, Threshold)) in update()
336 nodes[n].getDissentingNeighbors(TodoList, nodes); in update()
[all …]
/freebsd-12.1/contrib/subversion/subversion/libsvn_fs_base/bdb/
H A Dnodes-table.c55 DB *nodes; in svn_fs_bdb__open_nodes_table() local
58 BDB_ERR(db_create(&nodes, env, 0)); in svn_fs_bdb__open_nodes_table()
59 BDB_ERR((nodes->open)(SVN_BDB_OPEN_PARAMS(nodes, NULL), in svn_fs_bdb__open_nodes_table()
69 BDB_ERR(nodes->put(nodes, 0, in svn_fs_bdb__open_nodes_table()
74 *nodes_p = nodes; in svn_fs_bdb__open_nodes_table()
103 bfd->nodes->get(bfd->nodes, trail->db_txn, in svn_fs_bdb__new_node_id()
116 db_err = bfd->nodes->put(bfd->nodes, trail->db_txn, in svn_fs_bdb__new_node_id()
183 bfd->nodes->del(bfd->nodes, in svn_fs_bdb__delete_nodes_entry()
209 db_err = bfd->nodes->get(bfd->nodes, trail->db_txn, in svn_fs_bdb__get_node_revision()
254 bfd->nodes->put(bfd->nodes, db_txn, in svn_fs_bdb__put_node_revision()
/freebsd-12.1/contrib/gcc/
H A Dddg.c489 g->closing_branch = &g->nodes[i]; in create_ddg()
498 g->nodes[i].cuid = i; in create_ddg()
504 g->nodes[i++].insn = insn; in create_ddg()
543 free (g->nodes); in free_ddg()
704 sbitmap_copy (scc->nodes, nodes); in create_scc()
732 sbitmap_free (scc->nodes); in free_scc()
777 if (insn == g->nodes[i].insn) in get_node_of_insn()
778 return &g->nodes[i]; in get_node_of_insn()
1001 if (TEST_BIT (nodes, v) in update_dist_to_successors()
1031 g->nodes[i].aux.count = -1; in longest_simple_path()
[all …]
H A Dmodulo-sched.c409 ddg_node_ptr u = &g->nodes[i]; in calculate_maxii()
442 ddg_node_ptr u = &g->nodes[i]; in generate_reg_moves()
517 rep->insn = g->nodes[i_use].insn; in generate_reg_moves()
551 ddg_node_ptr u = &ps->g->nodes[i]; in undo_generate_reg_moves()
600 ddg_node_ptr u = &g->nodes[i]; in normalize_sched_times()
655 if (last == ps->g->nodes[i].insn in undo_permute_partial_schedule()
656 || last == ps->g->nodes[i].first_note) in undo_permute_partial_schedule()
659 reorder_insns_nobb (ps->g->nodes[i].first_note, ps->g->nodes[i].insn, in undo_permute_partial_schedule()
1700 ddg_node_ptr v = &g->nodes[i]; in sms_order_nodes()
1951 v_node = &g->nodes[v]; in order_nodes_in_scc()
[all …]
/freebsd-12.1/crypto/openssl/crypto/x509v3/
H A Dpcy_node.c28 X509_POLICY_NODE *tree_find_sk(STACK_OF(X509_POLICY_NODE) *nodes, in tree_find_sk() argument
38 idx = sk_X509_POLICY_NODE_find(nodes, &l); in tree_find_sk()
39 return sk_X509_POLICY_NODE_value(nodes, idx); in tree_find_sk()
49 for (i = 0; i < sk_X509_POLICY_NODE_num(level->nodes); i++) { in level_find_node()
50 node = sk_X509_POLICY_NODE_value(level->nodes, i); in level_find_node()
80 if (level->nodes == NULL) in level_add_node()
81 level->nodes = policy_node_cmp_new(); in level_add_node()
82 if (level->nodes == NULL) { in level_add_node()
86 if (!sk_X509_POLICY_NODE_push(level->nodes, node)) { in level_add_node()
H A Dpcy_tree.c369 node = sk_X509_POLICY_NODE_value(last->nodes, i); in tree_link_any()
393 STACK_OF(X509_POLICY_NODE) *nodes; in tree_prune()
396 nodes = curr->nodes; in tree_prune()
399 node = sk_X509_POLICY_NODE_value(nodes, i); in tree_prune()
404 (void)sk_X509_POLICY_NODE_delete(nodes, i); in tree_prune()
411 nodes = curr->nodes; in tree_prune()
413 node = sk_X509_POLICY_NODE_value(nodes, i); in tree_prune()
417 (void)sk_X509_POLICY_NODE_delete(nodes, i); in tree_prune()
646 STACK_OF(X509_POLICY_NODE) *nodes, *auth_nodes = NULL; in X509_policy_check()
694 nodes = X509_policy_tree_get0_user_policies(tree); in X509_policy_check()
[all …]
H A Dpcy_lib.c67 if (level->nodes) in X509_policy_level_node_count()
68 n += sk_X509_POLICY_NODE_num(level->nodes); in X509_policy_level_node_count()
81 return sk_X509_POLICY_NODE_value(level->nodes, i); in X509_policy_level_get0_node()
/freebsd-12.1/bin/sh/
H A DMakefile17 GENSRCS= builtins.c nodes.c syntax.c
18 GENHDRS= builtins.h nodes.h syntax.h token.h
50 .ORDER: nodes.c nodes.h
51 nodes.h: .NOMETA
52 nodes.c nodes.h: mknodes nodetypes nodes.c.pat
53 ${BTOOLSPATH:U.}/mknodes ${.CURDIR}/nodetypes ${.CURDIR}/nodes.c.pat
/freebsd-12.1/contrib/libgnuregex/
H A Dregex_internal.c25 const re_node_set *nodes,
28 const re_node_set *nodes,
1429 dfa->nodes = new_nodes; in re_dfa_add_node()
1462 hash += nodes->elems[i]; in calc_state_hash()
1478 const re_node_set *nodes) in re_acquire_state() argument
1497 if (re_node_set_compare (&state->nodes, nodes)) in re_acquire_state()
1528 if (nodes->nelem == 0) in re_acquire_state_context()
1623 err = re_node_set_init_copy (&newstate->nodes, nodes); in create_ci_newstate()
1633 re_token_t *node = dfa->nodes + nodes->elems[i]; in create_ci_newstate()
1673 err = re_node_set_init_copy (&newstate->nodes, nodes); in create_cd_newstate()
[all …]
H A Dregexec.c148 const re_node_set *nodes)
673 if (dfa->init_state->nodes.nelem == 0
1257 return state->nodes.elems[i]; in check_halt_state_context()
1316 if (dfa->nodes[node].accept_mb) in proceed_next_node()
1770 &src[st_idx]->nodes); in merge_state_array()
1958 switch (dfa->nodes[node].type) in check_dst_limits_calc_pos_1()
2165 type = dfa->nodes[node].type; in sift_states_bkref()
2593 for (i = 0; i < nodes->nelem; ++i) in transit_state_bkref()
2596 int node_idx = nodes->elems[i]; in transit_state_bkref()
2783 const re_node_set *nodes; in get_subexp() local
[all …]
/freebsd-12.1/contrib/llvm/include/llvm/IR/
H A DMetadata.def28 // Handler for leaf nodes in the class hierarchy.
33 // Handler for non-leaf nodes in the class hierarchy.
38 // Handler for specialized and uniquable leaf nodes under MDNode. Defers to
51 // Handler for leaf nodes under MDNode.
56 // Handler for leaf nodes under MDNode.
61 // Handler for non-leaf nodes under MDNode.
66 // Handler for specialized leaf nodes under MDNode.
71 // Handler for specialized non-leaf nodes under MDNode.
/freebsd-12.1/contrib/ipfilter/lib/
H A Dprintdstlist.c11 printdstlist(pp, copyfunc, name, opts, nodes, fields) in printdstlist() argument
16 ipf_dstnode_t *nodes;
36 if (nodes == NULL) {
39 for (node = nodes; node != NULL; ) {
H A Dload_dstlist.c17 load_dstlist(dst, iocfunc, nodes) in load_dstlist() argument
20 ipf_dstnode_t *nodes;
54 printdstlist(&dest, bcopywrap, dest.ipld_name, opts, nodes, NULL);
58 for (a = nodes; a != NULL; a = a->ipfd_next)
/freebsd-12.1/sys/netgraph/
H A DNOTES42 - Have a user level program to print out and manipulate nodes, etc.
49 command to list all existing nodes (in case you don't know the
53 - Need a way to get a list of ALL nodes.
57 - Enhance "netstat" to display all netgraph nodes -- or at least
58 all netgraph socket nodes.
68 - Need to implement passing meta information through socket nodes
77 - All nodes assume that all data mbufs have the M_PKTHDR flag set!
97 Every node has a queue, plus there is a list of nodes that have queued work.
/freebsd-12.1/usr.sbin/bluetooth/hccontrol/
H A Dhccontrol.c107 struct nodeinfo *nodes; in socket_open() local
110 num = find_hci_nodes(&nodes); in socket_open()
115 node = lnode = strdup(nodes[0].name); in socket_open()
120 free(nodes); in socket_open()
284 find_hci_nodes(struct nodeinfo** nodes) in find_hci_nodes() argument
312 *nodes = r.names; in find_hci_nodes()
/freebsd-12.1/sys/gnu/dts/arm/
H A Ds3c6400.dtsi7 * Samsung's S3C6400 SoC device nodes are listed in this file. S3C6400
11 * Note: This file does not include device nodes for all the controllers in
13 * nodes can be added to this file.

12345678910>>...14