Searched refs:nodes (Results 51 - 75 of 115) sorted by relevance

12345

/freebsd-11-stable/sys/netinet/
H A Dsiftr.c235 STAILQ_ENTRY(pkt_node) nodes;
242 LIST_ENTRY(flow_hash_node) nodes;
369 * Loop through the hash nodes in the list.
374 LIST_FOREACH(hash_node, counter_list, nodes) {
400 LIST_INSERT_HEAD(counter_list, hash_node, nodes);
597 STAILQ_FOREACH_SAFE(pkt_node, &tmp_pkt_queue, nodes,
600 STAILQ_REMOVE_HEAD(&tmp_pkt_queue, nodes);
984 STAILQ_INSERT_TAIL(&pkt_queue, pn, nodes);
1100 STAILQ_INSERT_TAIL(&pkt_queue, pn, nodes);
1333 LIST_FOREACH_SAFE(counter, counter_hash + i, nodes,
[all...]
/freebsd-11-stable/contrib/libarchive/libarchive/
H A Darchive_read.c255 for (i = 0; i < self->archive->client.nodes; i++)
388 if (a->client.nodes == 0)
398 a->client.nodes = 1;
401 if (iindex > a->client.nodes - 1)
423 if (iindex > a->client.nodes) {
429 * (++(a->client.nodes)));
436 for (i = a->client.nodes - 1; i > iindex; i--) {
451 return archive_read_add_callback_data(_a, client_data, a->client.nodes);
485 for (i = 0; i < a->client.nodes; i++)
1399 filter->archive->client.nodes
[all...]
H A Darchive_read_private.h143 unsigned int nodes; member in struct:archive_read_client
/freebsd-11-stable/crypto/openssl/apps/
H A DCA.pl.in8 # CA -newreq[-nodes] ... will generate a certificate request
67 print STDERR "usage: CA -newcert|-newreq|-newreq-nodes|-newca|-sign|-signcert|-verify\n";
79 } elsif (/^-newreq-nodes$/) {
81 system ("$REQ -new -nodes -keyout newkey.pem -out newreq.pem $DAYS");
167 print STDERR "usage: CA -newcert|-newreq|-newreq-nodes|-newca|-sign|-verify\n";
/freebsd-11-stable/sbin/pfctl/
H A Dpfctl_qstats.c96 int nodes, dotitle = (opts & PF_OPT_SHOWALL); local
103 if ((nodes = pfctl_update_qstats(dev, &root)) < 0)
106 if (nodes == 0)
118 while (verbose2 && nodes > 0) {
122 if ((nodes = pfctl_update_qstats(dev, &root)) == -1)
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/X86/
H A DImmutableGraph.h11 /// implemented as two arrays: one containing nodes, and one containing edges.
14 /// 2. Operations on sets of nodes/edges are efficient, and representations of
91 ArrayRef<Node> nodes() const { return makeArrayRef(Nodes.get(), NodesSize); } function in class:llvm::ImmutableGraph
92 const Node *nodes_begin() const { return nodes().begin(); }
93 const Node *nodes_end() const { return nodes().end(); }
364 // Walk the nodes and determine the new index for each node.
367 for (const Node &N : G.nodes()) {
376 for (const Node &N : G.nodes()) {
H A DX86LoadValueInjectionLoadHardening.cpp107 typedef int (*OptimizeCutT)(unsigned int *nodes, unsigned int nodes_size,
537 LLVM_DEBUG(dbgs() << "Found " << G->nodes_size() << " nodes\n");
562 for (const auto &RootN : G.nodes()) {
566 // Find all of the nodes that are CFG-reachable from RootN using DFS
633 for (const auto &N : Graph->nodes()) {
688 // First, collect all gadget source and sink nodes.
690 for (const auto &N : Graph->nodes()) {
705 for (const auto &N : Graph->nodes()) {
737 for (const auto &N : G.nodes()) {
/freebsd-11-stable/contrib/ofed/opensm/opensm/
H A Dosm_ucast_dfsssp.c103 vertex_t **nodes; /* array with pointers to elements of the adj_list */ member in struct:binary_heap
124 cdg_link_t *linklist; /* edges to adjazent nodes */
189 return (heap->nodes[i]->distance < heap->nodes[j]->distance) ? 1 : 0;
199 tmp_heap_id = heap->nodes[i]->heap_id;
200 heap->nodes[i]->heap_id = heap->nodes[j]->heap_id;
201 heap->nodes[j]->heap_id = tmp_heap_id;
203 tmp_node = heap->nodes[i];
204 heap->nodes[
[all...]
/freebsd-11-stable/contrib/dtc/Documentation/
H A Ddtc-paper.tex74 The device tree consists of nodes representing devices or
238 stored. Because it's common for many nodes to have properties with
254 device tree. The flattened tree need only provide those nodes and
257 For example, an OF device tree would normally include nodes for each
258 PCI device on the system. A flattened tree need only include nodes
261 nodes for devices where the kernel needs extra information, though:
282 nodes in the tree. For example, devices that produce interrupts
294 only nodes that are actually referred to by phandle need to have this
297 Another complication arises because nodes in an OF tree have two
305 node's \texttt{reg} property. In addition, nodes hav
[all...]
/freebsd-11-stable/sys/net/
H A Dradix.h110 struct radix_head *head, struct radix_node nodes[]);
H A Dradix.c388 * This routine initializes the relevant fields of the nodes, so that
389 * the leaf is the left child of the parent node, and both nodes have
396 rn_newpair(void *v, int b, struct radix_node nodes[2]) argument
398 struct radix_node *tt = nodes, *t = tt + 1;
427 struct radix_node nodes[2])
468 t = rn_newpair(v_arg, b, nodes);
614 * nodes and possibly save time in calculating indices.
1105 * Initialize an empty tree. This has 3 nodes, which are passed
1136 /* Free <left,root,right> nodes. */
426 rn_insert(void *v_arg, struct radix_head *head, int *dupentry, struct radix_node nodes[2]) argument
/freebsd-11-stable/sys/dev/ocs_fc/
H A Docs_xport.h171 uint32_t nodes_count; /**< number of allocated nodes */
172 ocs_node_t **nodes; /**< array of pointers to nodes */ member in struct:ocs_xport_s
173 ocs_list_t nodes_free_list; /**< linked list of free nodes */
H A Docs_node.c37 * between fabric (ocs_fabric.c) and device (ocs_device.c) nodes.
144 /* If we're using HLM, forward the NODE_ATTACH_OK/FAIL event to all nodes in the node group */
230 * @param node_count count of nodes to allocate
248 xport->nodes = ocs_malloc(ocs, node_count * sizeof(ocs_node_t *), OCS_M_ZERO | OCS_M_NOWAIT);
249 if (xport->nodes == NULL) {
286 xport->nodes[i] = node;
314 if (!xport->nodes)
320 node = xport->nodes[i];
326 xport->nodes[i] = NULL;
329 ocs_free(ocs, xport->nodes, (xpor
[all...]
/freebsd-11-stable/contrib/gcc/
H A Ddominance.c51 /* We name our nodes with integers, beginning with 1. Zero is reserved for
70 exists a way to x only over nodes behind x. Such a node is also called
76 /* bucket[x] points to the first node of the set of nodes having x as key. */
101 more nodes that basic blocks, so only dfs_to_bb[dfs_order[bb->index]]==bb
107 /* The number of nodes in the DFS tree (==dfsnum-1). */
108 unsigned int nodes; member in struct:dom_info
169 di->nodes = 0;
198 node. After this is done all nodes reachable from BB were visited, have
311 because there may be nodes from which the EXIT_BLOCK is unreachable. */
326 /* In the post-dom case we may have nodes withou
[all...]
H A Dcfganal.c179 /* Allocate bitmap to track nodes that have been visited. */
182 /* None of the nodes in the CFG have been visited yet. */
525 flow_nodes_print (const char *str, const sbitmap nodes, FILE *file)
530 if (! nodes)
534 EXECUTE_IF_SET_IN_SBITMAP (nodes, 0, node, sbi)
623 nodes not reachable from the exit block. */
631 /* Perform depth-first search in the reverse graph to find nodes
636 /* Repeatedly add fake edges, updating the unreachable nodes. */
671 /* Allocate bitmap to track nodes that have been visited. */
674 /* None of the nodes i
522 flow_nodes_print(const char *str, const sbitmap nodes, FILE *file) argument
[all...]
H A Dtree-outof-ssa.c58 The node and pred/succ list is a simple linear list of nodes and
59 edges represented as pairs of nodes.
71 each other. This means that no virtual PHI nodes are included, and
74 This also limits the number of possible nodes that are involved to
76 of nodes encountered was 12. */
82 /* List of nodes in the elimination graph. */
83 VEC(tree,heap) *nodes;
91 /* Stack for visited nodes. */
214 /* Create an elimination graph with SIZE nodes and associated data
222 g->nodes
[all...]
H A Dtree-dump.c44 /* Add T to the end of the queue of nodes to dump. Returns the index
70 dq->node = splay_tree_insert (di->nodes, (splay_tree_key) t,
108 n = splay_tree_lookup (di->nodes, (splay_tree_key) t);
300 /* We can knock off a bunch of expression nodes in exactly the same
322 /* These nodes are handled explicitly below. */
403 /* Now handle the various kinds of nodes. */
561 /* These nodes are unary, but do not have code class `1'. */
574 /* These nodes are binary, but do not have code class `2'. */
721 di.nodes = splay_tree_new (splay_tree_compare_pointers, 0,
727 /* Until the queue is empty, keep dumping nodes
[all...]
/freebsd-11-stable/contrib/llvm-project/lldb/source/Plugins/SymbolFile/NativePDB/
H A DPdbAstBuilder.cpp395 RenderScopeList(llvm::ArrayRef<llvm::ms_demangle::Node *> nodes) { argument
396 lldbassert(!nodes.empty());
398 std::string result = nodes.front()->toString();
399 nodes = nodes.drop_front();
400 while (!nodes.empty()) {
402 result += nodes.front()->toString(llvm::ms_demangle::OF_NoTagSpecifier);
403 nodes = nodes.drop_front();
551 // Render the current list of scope nodes a
[all...]
/freebsd-11-stable/contrib/llvm-project/lld/lib/ReaderWriter/MachO/
H A DMachOLinkingContext.cpp174 auto &nodes = getNodes(); local
175 for (unsigned i = 0, e = nodes.size(); i != e; ++i) {
176 FileNode *node = dyn_cast<FileNode>(nodes[i].get());
936 MachOLinkingContext::findOrderOrdinal(const std::vector<OrderFileNode> &nodes, argument
945 for (const OrderFileNode &info : nodes) {
/freebsd-11-stable/cddl/contrib/opensolaris/lib/libdtrace/common/
H A Ddt_xlator.c99 const char *name, dt_node_t *members, dt_node_t *nodes)
201 * create member nodes for every member of the output type. Otherwise
210 dxp->dx_nodes = nodes;
97 dt_xlator_create(dtrace_hdl_t *dtp, const dtrace_typeinfo_t *src, const dtrace_typeinfo_t *dst, const char *name, dt_node_t *members, dt_node_t *nodes) argument
/freebsd-11-stable/contrib/apr/memory/unix/
H A Dapr_pools.c144 * Lists of free nodes. Slot 0 is used for oversized nodes,
145 * and the slots 1..MAX_INDEX-1 contain nodes of sizes
147 * slot 0: nodes larger than 81920
303 /* First see if there are any nodes in the area we know
313 * any nodes on it of the requested size
332 * nodes waiting in line behind it _and_ we are on
374 * any nodes on it of the requested size
450 /* Walk the list of submitted nodes and free them one by one,
598 debug_node_t *nodes; member in struct:apr_pool_t
[all...]
/freebsd-11-stable/sbin/routed/
H A Dradix.c330 rn_newpair(void *v, int b, struct radix_node nodes[2]) argument
332 struct radix_node *tt = nodes, *t = tt + 1;
348 struct radix_node nodes[2])
393 t = rn_newpair(v_arg, b, nodes); tt = t->rn_l;
539 * nodes and possibly save time in calculating indices.
345 rn_insert(void* v_arg, struct radix_node_head *head, int *dupentry, struct radix_node nodes[2]) argument
/freebsd-11-stable/contrib/ofed/libibnetdisc/
H A Dchassis.c1006 This function fills chassis structure with all nodes
1222 node->next_chassis_node = chassis->nodes;
1223 chassis->nodes = node;
1233 3. pass on non Voltaire nodes (SystemImageGUID based grouping)
1234 4. now group non Voltaire nodes by SystemImageGUID
1269 /* algorithm: catch spine and find all surrounding nodes */
1285 /* now make pass on nodes for chassis which are not Voltaire */
1287 for (node = fabric->nodes; node; node = node->next) {
1308 /* now, make another pass to see which nodes are part of chassis */
1310 for (node = fabric->nodes; nod
[all...]
H A Dibnetdisc.c490 /* add this to the all nodes list */
491 rc->next = f_int->fabric.nodes;
492 f_int->fabric.nodes = rc;
646 PRIx64 " already exists in nodes DB\n",
851 node = fabric->nodes;
876 for (cur = fabric->nodes; cur; cur = cur->next)
/freebsd-11-stable/etc/rc.d/
H A Dsendmail135 openssl req -batch -nodes -new -x509 -keyout newkey.pem \

Completed in 190 milliseconds

12345