Searched refs:nodes (Results 76 - 100 of 115) sorted by relevance

12345

/freebsd-11-stable/contrib/subversion/subversion/libsvn_wc/
H A Ddiff_editor.c162 /* A hash containing the basenames of the nodes reported deleted by the
634 apr_hash_t *nodes;
650 SVN_ERR(svn_wc__db_read_children_info(&nodes, &conflicts,
655 children = svn_sort__hash(nodes, svn_sort_compare_items_lexically,
1147 apr_hash_t *nodes;
1153 SVN_ERR(svn_wc__db_read_children_info(&nodes, &conflicts,
1159 children = svn_sort__hash(nodes, svn_sort_compare_items_lexically,
1472 apr_hash_t *nodes;
1477 SVN_ERR(svn_wc__db_base_get_children_info(&nodes, db, local_abspath,
1480 children = svn_sort__hash(nodes, svn_sort_compare_items_lexicall
633 apr_hash_t *nodes; local
1146 apr_hash_t *nodes; local
1471 apr_hash_t *nodes; local
[all...]
H A Dcopy.c327 otherwise copy both the versioned metadata and the filesystem nodes (even
1010 apr_hash_t *nodes;
1018 SVN_ERR(svn_wc__db_read_children_info(&nodes, &conflicts, db,
1023 for (hi = apr_hash_first(scratch_pool, nodes);
1008 apr_hash_t *nodes; local
H A Dstatus.c94 /* Scan the working copy for local modifications and missing nodes. */
1174 * determined. For example, in 'svn status', plain unversioned nodes show
1195 for all its child nodes (according to DEPTH) through STATUS_FUNC /
1236 apr_hash_t *dirents, *nodes, *conflicts, *all_children;
1284 SVN_ERR(svn_wc__db_read_children_info(&nodes, &conflicts,
1289 all_children = apr_hash_overlay(scratch_pool, nodes, dirents);
1363 child_info = apr_hash_get(nodes, key, klen);
1398 * unversioned nodes. An unversioned and tree-conflicted node however should
1233 apr_hash_t *dirents, *nodes, *conflicts, *all_children; local
H A Dwc_db.h403 const char *. The child nodes do NOT have to exist when this API
405 node will be added. These child nodes will be added regardless of
454 /* Add a new directory in BASE, whether WORKING nodes exist or not. Mark it
811 svn_wc__db_base_get_children_info(apr_hash_t **nodes,
1346 * incomplete nodes for the children.
1383 * layer and adds base-deleted nodes on dst_abspath layer to mark these nodes
1400 CHILDREN must be provided, and incomplete nodes will be constructed
1546 * (DELETE_DIR_EXTERNALS should be true if also removing unversioned nodes)
1583 * (DELETE_DIR_EXTERNALS should be true if also removing unversioned nodes)
[all...]
/freebsd-11-stable/contrib/libgnuregex/
H A Dregex_internal.h451 /* `node_idx' is the index in dfa->nodes, if `type' == 0.
498 re_node_set nodes; member in struct:re_dfastate_t
618 re_token_t *nodes; member in struct:re_dfa_t
/freebsd-11-stable/usr.sbin/bsdconfig/dot/
H A Ddot67 # Create a new multi-node list rendering nodes in a specific style described by
349 printf '\t\twidth = 2.5, // arbitrary minimum width for all nodes\n'
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Support/
H A DGraphWriter.h118 // Emit all of the nodes in the graph...
156 for (const auto Node : nodes<GraphType>(G))
/freebsd-11-stable/contrib/less/
H A Dsearch.c54 * create new nodes if possible. We remember the last node found by a
58 * nodes also in constant time.
63 * need to maintain a usage bitmap or freelist and can just return nodes
86 struct hilite_node *nodes; member in struct:hilite_storage
386 free((void*)hls->nodes);
664 * Tree node storage: get the current block of nodes if it has spare
682 s->nodes = (struct hilite_node *) ecalloc(capacity, sizeof(struct hilite_node));
703 return &s->nodes[s->used++];
/freebsd-11-stable/contrib/libucl/src/
H A Ducl_schema.c439 struct ucl_compare_node *node, test, *nodes = NULL, *tmp; local
460 LL_PREPEND (nodes, node);
463 LL_FOREACH_SAFE (nodes, node, tmp) {
/freebsd-11-stable/contrib/ofed/infiniband-diags/src/
H A Dibnetdiscover.c583 for (node = ch->nodes; node;
630 for (node = ch->nodes; node;
647 for (node = ch->nodes; node;
1082 {"list", 'l', 0, NULL, "list of connected nodes"},
/freebsd-11-stable/contrib/ofed/libibnetdisc/
H A Dibnetdisc_cache.c66 * Bytes X-Y - nodes (variable length)
544 node->next = fabric_cache->f_int->fabric.nodes;
545 fabric_cache->f_int->fabric.nodes = node;
929 node = fabric->nodes;
/freebsd-11-stable/contrib/llvm-project/llvm/utils/TableGen/
H A DDAGISelMatcher.h39 /// nodes.
151 /// we can move this matcher past all of the nodes in-between Other and this
163 // we always match a node against nodes with kinds that are greater or equal
684 /// MatchNumber - This is the recorded nodes slot that contains the node we
903 /// chains together with a token factor. The list of nodes are the nodes in the
905 /// chains of these nodes if they are not themselves a node in the pattern.
909 EmitMergeInputChainsMatcher(ArrayRef<unsigned> nodes) argument
910 : Matcher(EmitMergeInputChains), ChainNodes(nodes.begin(), nodes
[all...]
/freebsd-11-stable/contrib/libarchive/libarchive/
H A Darchive_read_support_format_rar.c266 unsigned int nodes; member in struct:rar
1171 if (rar->cursor < rar->nodes &&
1552 if (rar->cursor >= rar->nodes)
1554 rar->nodes++;
1556 realloc(rar->dbo, sizeof(*rar->dbo) * rar->nodes)) == NULL)
1596 rar->nodes = 1;
/freebsd-11-stable/crypto/openssl/apps/
H A Dreq.c118 * -nodes - no des encryption
179 int nodes = 0, kludge = 0, newhdr = 0, subject = 0, pubkey = 0; local
311 else if (strcmp(*argv, "-nodes") == 0)
312 nodes = 1;
390 BIO_printf(bio_err, " -nodes don't encrypt the output key\n");
709 if (nodes)
H A Dapps.c2503 STACK_OF(X509_POLICY_NODE) *nodes)
2508 if (nodes) {
2510 for (i = 0; i < sk_X509_POLICY_NODE_num(nodes); i++) {
2511 node = sk_X509_POLICY_NODE_value(nodes, i);
2502 nodes_print(BIO *out, const char *name, STACK_OF(X509_POLICY_NODE) *nodes) argument
/freebsd-11-stable/sys/mips/nlm/
H A Dboard.c407 nodep = &boardp->nodes[node];
/freebsd-11-stable/sys/xen/interface/
H A Dsysctl.h100 uint32_t nr_nodes; /* # nodes currently online */
198 int32_t node; /* NUMA node of interest (-1 for all nodes). */
532 * Distance between nodes 'i' and 'j' is stored in index 'i*N + j',
533 * where N is the number of nodes that will be returned in 'num_nodes'
680 * IN: Number of elements in 'pcitopo' and 'nodes' arrays.
695 XEN_GUEST_HANDLE_64(uint32) nodes; member in struct:xen_sysctl_pcitopoinfo
/freebsd-11-stable/contrib/llvm-project/lld/include/lld/ReaderWriter/
H A DMachOLinkingContext.h447 static bool findOrderOrdinal(const std::vector<OrderFileNode> &nodes,
/freebsd-11-stable/sys/cddl/contrib/opensolaris/uts/common/fs/zfs/
H A Dspace_map.c756 uint64_t nodes = avl_numnodes(&rt->rt_root); local
765 VERIFY3U(nodes, ==, avl_numnodes(&rt->rt_root));
957 * its histogram buckets instead of iterating through its nodes.
/freebsd-11-stable/contrib/subversion/subversion/libsvn_fs_base/
H A Dfs.c52 #include "bdb/nodes-table.h"
169 SVN_ERR(cleanup_fs_db(fs, &bfd->nodes, "nodes"));
641 ? N_("creating 'nodes' table")
642 : N_("opening 'nodes' table")),
643 svn_fs_bdb__open_nodes_table(&bfd->nodes,
1211 /* ### We're only asking for the pagesize on the 'nodes' table.
1382 "nodes", pagesize, FALSE, pool));
/freebsd-11-stable/sys/dev/firewire/
H A Dfirewire.c1375 device_printf(fc->bdev, "%d nodes, maxhop <= %d %s irm(%d) %s\n",
1413 "iterate and invalidate all nodes\n",
1683 char nodes[63]; local
1695 /* We don't probe myself and linkdown nodes */
1715 nodes[todo++] = node;
1722 dfwdev.dst = nodes[i];
1725 nodes[todo2++] = nodes[i];
/freebsd-11-stable/usr.sbin/freebsd-update/
H A Dfreebsd-update.sh1719 sort -u > ${X}.nodes
1724 comm -23 $1.nodes $2.nodes > $1.badnodes
1736 rm $1.badnodes $1.nodes $2.nodes
/freebsd-11-stable/sbin/pfctl/
H A Dpfctl_parser.c949 printf("max-src-nodes %u", r->max_src_nodes);
1055 struct node_tinithead *nodes)
1067 SIMPLEQ_FOREACH(ti, nodes, entries) {
1086 if (addrs && SIMPLEQ_EMPTY(nodes))
1054 print_tabledef(const char *name, int flags, int addrs, struct node_tinithead *nodes) argument
/freebsd-11-stable/lib/clang/libclang/
H A DMakefile794 ${CLANG_TBLGEN} -gen-clang-comment-nodes \
800 ${CLANG_TBLGEN} -gen-clang-decl-nodes \
813 ${CLANG_TBLGEN} -gen-clang-stmt-nodes \
819 ${CLANG_TBLGEN} -gen-clang-type-nodes \
/freebsd-11-stable/contrib/jemalloc/src/
H A Dctl.c17 /* Helpers for named and indexed nodes. */
224 * Only handles internal indexed nodes, since there are currently no external
920 ctl_node_t const *nodes[CTL_MAX_DEPTH]; local
930 ret = ctl_lookup(tsd_tsdn(tsd), name, nodes, mib, &depth);
934 node = ctl_named_node(nodes[depth-1]);

Completed in 665 milliseconds

12345