Searched refs:nodes (Results 26 - 50 of 115) sorted by relevance

12345

/freebsd-11-stable/contrib/libgnuregex/
H A Dregexec.c148 const re_node_set *nodes)
158 static int find_subexp_node (const re_dfa_t *dfa, const re_node_set *nodes,
676 if (dfa->init_state->nodes.nelem == 0
677 && dfa->init_state_word->nodes.nelem == 0
678 && (dfa->init_state_nl->nodes.nelem == 0
1127 err = check_subexp_matching_top (mctx, &cur_state->nodes, 0);
1133 err = transit_state_bkref (mctx, &cur_state->nodes);
1232 re_token_type_t type = dfa->nodes[node].type;
1233 unsigned int constraint = dfa->nodes[node].constraint;
1258 for (i = 0; i < state->nodes
2586 transit_state_bkref(re_match_context_t *mctx, const re_node_set *nodes) argument
2783 const re_node_set *nodes; local
2878 find_subexp_node(const re_dfa_t *dfa, const re_node_set *nodes, int subexp_idx, int type) argument
[all...]
H A Dregcomp.c309 for (node_cnt = 0; node_cnt < init_state->nodes.nelem; ++node_cnt)
311 int node = init_state->nodes.elems[node_cnt];
312 re_token_type_t type = dfa->nodes[node].type;
316 re_set_fastmap (fastmap, icase, dfa->nodes[node].opr.c);
325 *p++ = dfa->nodes[node].opr.c;
327 && dfa->nodes[node].type == CHARACTER
328 && dfa->nodes[node].mb_partial)
329 *p++ = dfa->nodes[node].opr.c;
345 bitset_word_t w = dfa->nodes[node].opr.sbcset[i];
354 re_charset_t *cset = dfa->nodes[nod
[all...]
/freebsd-11-stable/sbin/routed/
H A Dradix.h113 struct radix_node_head *head, struct radix_node nodes[]);
116 struct radix_node_head *head, struct radix_node nodes[]);
/freebsd-11-stable/contrib/llvm-project/clang/utils/TableGen/
H A DASTTableGen.cpp52 // Type nodes are all named ending in Type, just like the corresponding
61 // Stmt nodes are named the same as the C++ class, which has no regular
93 // A map from a node to each of its child nodes.
116 // Find all the nodes in the hierarchy.
117 auto nodes = records.getAllDerivedDefinitions(nodeClassName); local
122 for (ASTNode node : nodes) {
127 "multiple root nodes in " + nodeClassName + " hierarchy");
/freebsd-11-stable/crypto/openssl/apps/
H A DCA.pl8 # 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";
H A DCA.sh58 echo "usage: $0 -newcert|-newreq|-newreq-nodes|-newca|-sign|-verify" >&2
96 -newreq-nodes)
98 $REQ -new -nodes -keyout newreq.pem -out newreq.pem $DAYS
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DSpillPlacement.h49 Node *nodes = nullptr; member in class:llvm::SpillPlacement
69 /// List of nodes that need to be updated in ::iterate.
130 /// Return true is there are any positive nodes.
/freebsd-11-stable/contrib/gcclibs/libiberty/
H A Dfibheap.c118 heap->nodes++;
161 /* Merge them to the next nodes on the opposite chain. */
167 heapa->nodes += heapb->nodes;
184 /* If we don't have a min set, it means we have no nodes. */
279 return heap->nodes == 0;
302 heap->nodes--;
304 /* If we are left with no nodes, then the min is NULL. */
305 if (heap->nodes == 0)
/freebsd-11-stable/contrib/binutils/libiberty/
H A Dfibheap.c118 heap->nodes++;
161 /* Merge them to the next nodes on the opposite chain. */
167 heapa->nodes += heapb->nodes;
184 /* If we don't have a min set, it means we have no nodes. */
279 return heap->nodes == 0;
302 heap->nodes--;
304 /* If we are left with no nodes, then the min is NULL. */
305 if (heap->nodes == 0)
/freebsd-11-stable/contrib/gcc/
H A Dmodulo-sched.c106 /* The number of different iterations the nodes in ps span, assuming
125 /* The number of nodes in the same row that come after this node. */
224 /* The column of a node inside the ps. If nodes u, v are on the same row,
370 node_sched_params[i].asap = g->nodes[i].aux.count;
371 g->nodes[i].aux.info = &node_sched_params[i];
412 ddg_node_ptr u = &g->nodes[i];
445 ddg_node_ptr u = &g->nodes[i];
476 Set a bitmap vector, telling which nodes use each copy of this
520 rep->insn = g->nodes[i_use].insn;
532 replace_rtx (g->nodes[i_us
1817 find_max_asap(ddg_ptr g, sbitmap nodes) argument
1838 find_max_hv_min_mob(ddg_ptr g, sbitmap nodes) argument
1867 find_max_dv_min_mob(ddg_ptr g, sbitmap nodes) argument
[all...]
H A Dcgraphunit.c79 This function is responsible for lowering tree nodes not understood by
81 callgraph and varpool nodes referenced by the as needed.
180 /* Records tree nodes seen in record_reference. Simply using
507 /* Since we reclaim unreachable nodes at the end of every language
703 /* Verify cgraph nodes of given cgraph node. */
786 /* The nodes we're interested in are never shared, so walk
987 /* Look for externally_visible and used attributes and mark cgraph nodes
990 We cannot mark the nodes at the point the attributes are processed (in
1001 Furthermore, we can't mark these nodes in cgraph_finalize_function because:
1008 So, we walk the nodes a
1367 struct cgraph_order_sort *nodes; local
[all...]
/freebsd-11-stable/contrib/ofed/libibnetdisc/
H A Dibnetdisc.h87 for those nodes */
90 struct ibnd_node *next_chassis_node; /* next node in ibnd_chassis_t->nodes */
134 ibnd_node_t *nodes; member in struct:ibnd_chassis
136 /* specific to voltaire type nodes */
172 /* NULL term list of all nodes in the fabric */
173 ibnd_node_t *nodes; member in struct:ibnd_fabric
/freebsd-11-stable/contrib/subversion/subversion/libsvn_fs_base/
H A Dfs.h102 DB *nodes;
99 DB *nodes; member in struct:base_fs_data_t
/freebsd-11-stable/sys/mips/nlm/
H A Dboard.h135 } nodes[XLP_MAX_NODES]; member in struct:xlp_board_info
/freebsd-11-stable/crypto/openssl/crypto/x509v3/
H A Dpcy_int.h138 /* This structure represents the relationship between nodes */
145 /* Number of child nodes */
152 /* nodes at this level */
153 STACK_OF(X509_POLICY_NODE) *nodes; member in struct:X509_POLICY_LEVEL_st
168 * Extra policy data when additional nodes (not from the certificate) are
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ADT/
H A DGraphTraits.h54 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
70 // Return total number of nodes in the graph
105 // Provide iterator ranges for the graph traits nodes and children
108 nodes(const GraphType &G) { function in namespace:llvm
/freebsd-11-stable/contrib/ipfilter/
H A Dradix_ipf.h60 ipf_rdx_node_t nodes[3]; member in struct:ipf_rdx_head
H A Dip_dstlist.c351 /* iterates through the list of destination lists or nodes. */
487 ipf_dstnode_t *node, **nodes; local
554 KMALLOCS(nodes, ipf_dstnode_t **,
555 sizeof(*nodes) * (d->ipld_maxnodes + 1));
556 if (nodes == NULL) {
563 bcopy(d->ipld_dests, nodes,
564 sizeof(*nodes) * d->ipld_maxnodes);
565 KFREES(d->ipld_dests, sizeof(*nodes) * d->ipld_nodes);
566 nodes[0]->ipfd_pnext = nodes;
[all...]
/freebsd-11-stable/sys/contrib/ipfilter/netinet/
H A Dradix_ipf.h58 ipf_rdx_node_t nodes[3]; member in struct:ipf_rdx_head
H A Dip_dstlist.c351 /* iterates through the list of destination lists or nodes. */
487 ipf_dstnode_t *node, **nodes; local
554 KMALLOCS(nodes, ipf_dstnode_t **,
555 sizeof(*nodes) * (d->ipld_maxnodes + 1));
556 if (nodes == NULL) {
563 bcopy(d->ipld_dests, nodes,
564 sizeof(*nodes) * d->ipld_maxnodes);
565 KFREES(d->ipld_dests, sizeof(*nodes) * d->ipld_nodes);
566 nodes[0]->ipfd_pnext = nodes;
[all...]
/freebsd-11-stable/sys/kern/
H A Dsubr_blist.c39 * leaf nodes (BLIST_BMAP_RADIX), and one for the number of descendents of
40 * each of the meta (interior) nodes (BLIST_META_RADIX). Each subtree is
47 * The radix tree also implements two collapsed states for meta nodes:
65 * sequentially in memory) by BLIST_META_RADIX lower level nodes. This
157 * number of leaf nodes of the subtree is L=radix/BLIST_BMAP_RADIX. If 'm'
159 * leaf nodes, the total number of tree nodes is 1 + m + m**2 + ... + m**h,
221 daddr_t nodes, radix; local
230 nodes = 1 + blst_radix_init(NULL, radix, blocks);
239 bl->bl_root = malloc(nodes * sizeo
508 daddr_t i, nodes, radix; local
[all...]
/freebsd-11-stable/contrib/subversion/subversion/libsvn_subr/
H A Dconfig_auth.c183 apr_hash_t *nodes;
198 err = svn_io_get_dirents3(&nodes, dir_path, TRUE, iterpool, iterpool);
210 for (hi = apr_hash_first(iterpool, nodes); hi; hi = apr_hash_next(hi))
182 apr_hash_t *nodes; local
/freebsd-11-stable/contrib/subversion/subversion/libsvn_wc/
H A Dwc-metadata.sql234 /* The NODES table describes the way WORKING nodes are layered on top of
235 BASE nodes and on top of other WORKING nodes, due to nested tree structure
251 This table contains full node descriptions for nodes in either the BASE
284 modifying the working copy tree structure. All nodes below the root
318 tree. The 'BASE' represents pristine nodes that are in the
323 layer of working nodes. The 'WORKING' tree is obtained and
374 copied). This is set on all the nodes in the moved tree. The source of
478 /* Many queries have to filter the nodes table to pick only that version
488 SELECT * FROM nodes A
[all...]
/freebsd-11-stable/contrib/bmake/
H A Dtarg.c86 * Functions for maintaining the Lst allTargets. Target nodes are
106 * Targ_FindList Given a list of names, find nodes for all
122 * nodes. Should be called after the
372 * A complete list of graph nodes corresponding to all instances of all
376 * If flags is TARG_CREATE, nodes will be created for all names in
377 * names which do not yet have graph nodes. If flags is TARG_NOCREATE,
384 Lst nodes; /* result list */ local
389 nodes = Lst_Init(FALSE);
392 return (nodes);
399 * Note: Lst_AtEnd must come before the Lst_Concat so the nodes
[all...]
/freebsd-11-stable/tools/tools/net80211/stumbler/
H A Dstumbler.c94 } *nodes = 0; variable in typeref:struct:node_info
104 while (nodes) {
105 next = nodes->next;
106 free(nodes);
107 nodes = next;
203 struct node_info* node = nodes;
459 node = nodes;
469 nodes = node;
499 // too many nodes for screen
501 struct node_info* ni = nodes;
[all...]

Completed in 578 milliseconds

12345