/freebsd-10-stable/contrib/subversion/subversion/libsvn_subr/ |
H A D | config_auth.c | 183 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-10-stable/contrib/bmake/ |
H A D | targ.c | 86 * 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-10-stable/contrib/libgnuregex/ |
H A D | regcomp.c | 309 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-10-stable/contrib/ipfilter/ |
H A D | ip_dstlist.c | 359 /* iterates through the list of destination lists or nodes. */ 495 ipf_dstnode_t *node, **nodes; local 562 KMALLOCS(nodes, ipf_dstnode_t **, 563 sizeof(*nodes) * (d->ipld_maxnodes + 1)); 564 if (nodes == NULL) { 571 bcopy(d->ipld_dests, nodes, 572 sizeof(*nodes) * d->ipld_maxnodes); 573 KFREES(d->ipld_dests, sizeof(*nodes) * d->ipld_nodes); 574 nodes[0]->ipfd_pnext = nodes; [all...] |
/freebsd-10-stable/contrib/texinfo/info/ |
H A D | session.c | 57 /* Array of structures describing for each window which nodes have been 71 /* Begin an info session finding the nodes specified by FILENAME and NODENAMES. 99 of remembered windows and nodes. Then tile the windows. */ 350 (info_win->nodes[info_win->current] == window->node)) 368 info_win->nodes = (NODE **)NULL; 381 the list of history nodes. This may happen only at the very 383 if (info_win->nodes 385 && info_win->nodes[info_win->current]->contents == node->contents 392 and points as well as nodes, it is more efficient to avoid the 397 info_win->nodes 2607 char **nodes = xmalloc (len * sizeof (char *)); local 2649 char **nodes = split_list_of_nodenames (line); local [all...] |
H A D | nodemenu.c | 1 /* nodemenu.c -- produce a menu of all visited nodes. 125 /* Produce an informative listing of all the visited nodes, and return it 127 which nodes will appear in the listing. FILTER_FUNC takes an argument 145 node = info_win->nodes[i]; 147 /* We skip mentioning "*Node Menu*" nodes. */ 202 ((char *) _("Here is the menu of nodes you have recently visited.\n\ 224 _("Make a window containing a menu of all of the currently visited nodes")) 277 not remove the flag. Otherwise, the *Node Menu* nodes themselves
|
/freebsd-10-stable/tools/tools/net80211/stumbler/ |
H A D | stumbler.c | 94 } *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...] |
/freebsd-10-stable/sys/contrib/ipfilter/netinet/ |
H A D | ip_dstlist.c | 359 /* iterates through the list of destination lists or nodes. */ 495 ipf_dstnode_t *node, **nodes; local 562 KMALLOCS(nodes, ipf_dstnode_t **, 563 sizeof(*nodes) * (d->ipld_maxnodes + 1)); 564 if (nodes == NULL) { 571 bcopy(d->ipld_dests, nodes, 572 sizeof(*nodes) * d->ipld_maxnodes); 573 KFREES(d->ipld_dests, sizeof(*nodes) * d->ipld_nodes); 574 nodes[0]->ipfd_pnext = nodes; [all...] |
/freebsd-10-stable/sys/netinet/ |
H A D | siftr.c | 233 STAILQ_ENTRY(pkt_node) nodes; 240 LIST_ENTRY(flow_hash_node) nodes; 367 * Loop through the hash nodes in the list. 372 LIST_FOREACH(hash_node, counter_list, nodes) { 398 LIST_INSERT_HEAD(counter_list, hash_node, nodes); 595 STAILQ_FOREACH_SAFE(pkt_node, &tmp_pkt_queue, nodes, 598 STAILQ_REMOVE_HEAD(&tmp_pkt_queue, nodes); 980 STAILQ_INSERT_TAIL(&pkt_queue, pn, nodes); 1096 STAILQ_INSERT_TAIL(&pkt_queue, pn, nodes); 1329 LIST_FOREACH_SAFE(counter, counter_hash + i, nodes, [all...] |
/freebsd-10-stable/contrib/libarchive/libarchive/ |
H A D | archive_read.c | 255 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 D | archive_read_private.h | 143 unsigned int nodes; member in struct:archive_read_client
|
/freebsd-10-stable/crypto/openssl/apps/ |
H A D | CA.pl.in | 8 # CA -newreq[-nodes] ... will generate a certificate request 67 print STDERR "usage: CA -newcert|-newreq|-newreq-nodes|-newca|-sign|-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-10-stable/sbin/pfctl/ |
H A D | pfctl_qstats.c | 96 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-10-stable/contrib/dtc/Documentation/ |
H A D | dtc-paper.tex | 74 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-10-stable/contrib/apr/memory/unix/ |
H A D | apr_pools.c | 104 * Lists of free nodes. Slot 0 is used for oversized nodes, 105 * and the slots 1..MAX_INDEX-1 contain nodes of sizes 107 * slot 0: nodes larger than 81920 238 /* First see if there are any nodes in the area we know 248 * any nodes on it of the requested size 267 * nodes waiting in line behind it _and_ we are on 312 * any nodes on it of the requested size 377 /* Walk the list of submitted nodes and free them one by one, 521 debug_node_t *nodes; member in struct:apr_pool_t [all...] |
/freebsd-10-stable/contrib/gcc/ |
H A D | dominance.c | 51 /* 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 D | cfganal.c | 179 /* 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 D | tree-outof-ssa.c | 58 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 D | tree-dump.c | 44 /* 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-10-stable/contrib/llvm/utils/TableGen/ |
H A D | DAGISelMatcher.h | 39 /// nodes. 83 MarkGlueResults, // Indicate which interior nodes have glue results. 155 /// we can move this matcher past all of the nodes in-between Other and this 167 // we always match a node against nodes with kinds that are greater or equal 690 /// MatchNumber - This is the recorded nodes slot that contains the node we 898 /// chains together with a token factor. The list of nodes are the nodes in the 900 /// chains of these nodes if they are not themselves a node in the pattern. 904 EmitMergeInputChainsMatcher(const unsigned *nodes, unsigned NumNodes) argument 905 : Matcher(EmitMergeInputChains), ChainNodes(nodes, node 1094 MarkGlueResultsMatcher(const unsigned *nodes, unsigned NumNodes) argument [all...] |
/freebsd-10-stable/lib/clang/ |
H A D | clang.build.mk | 180 ${CLANG_TBLGEN} -gen-clang-comment-nodes \ 185 ${CLANG_TBLGEN} -gen-clang-decl-nodes \ 190 ${CLANG_TBLGEN} -gen-clang-stmt-nodes \
|
/freebsd-10-stable/sys/kern/ |
H A D | subr_blist.c | 36 * involved: One for the bitmaps contained in the leaf nodes (typically 37 * 32), and one for the meta nodes (typically 16). Both meta and leaf 38 * nodes have a hint field. This field gives us a hint as to the largest 44 * The radix tree also implements two collapsed states for meta nodes: 62 * sequentially in memory) by BLIST_META_RADIX lower level nodes. This 162 daddr_t nodes, radix, skip; local 173 nodes = 1 + blst_radix_init(NULL, radix, skip, blocks); 183 bl->bl_root = malloc(nodes * sizeof(blmeta_t), M_SWAP, flags); 196 (long long)(nodes * sizeof(blmeta_t) + 1023) / 1024 199 (long long)nodes); [all...] |
/freebsd-10-stable/sys/cddl/contrib/opensolaris/uts/common/fs/zfs/ |
H A D | space_map.c | 248 uint64_t size, total, rt_space, nodes; local 286 nodes = avl_numnodes(&rt->rt_root); 335 VERIFY3U(nodes, ==, avl_numnodes(&rt->rt_root));
|
/freebsd-10-stable/cddl/contrib/opensolaris/lib/libdtrace/common/ |
H A D | dt_xlator.c | 99 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-10-stable/sbin/routed/ |
H A D | radix.c | 329 rn_newpair(void *v, int b, struct radix_node nodes[2]) argument 331 struct radix_node *tt = nodes, *t = tt + 1; 347 struct radix_node nodes[2]) 392 t = rn_newpair(v_arg, b, nodes); tt = t->rn_l; 538 * nodes and possibly save time in calculating indices. 344 rn_insert(void* v_arg, struct radix_node_head *head, int *dupentry, struct radix_node nodes[2]) argument
|