/freebsd-current/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | SpillPlacement.cpp | 70 /// value can change when linked nodes change, but convergence is very fast 95 // Undecided nodes (Value==0) go on the stack. 151 bool update(const Node nodes[], BlockFrequency Threshold) { argument 156 if (nodes[L.second].Value == -1) 158 else if (nodes[L.second].Value == 1) 181 const Node nodes[]) const { 186 if (Value != nodes[n].Value) 196 assert(!nodes && "Leaking node array"); 197 nodes = new Node[bundles->getNumBundles()]; 215 delete[] nodes; [all...] |
/freebsd-current/contrib/kyua/admin/ |
H A D | check-api-docs.awk | 48 /utils\/config\/nodes\.hpp.*Member set_lua\(lutok::state &, const int\)/ {next} 49 /utils\/config\/nodes\.hpp.*Member push_lua\(lutok::state &\)/ {next} 50 /utils\/config\/nodes\.hpp.*Member set_string\(const std::string &\)/ {next} 51 /utils\/config\/nodes\.hpp.*Member to_string\(void\)/ {next} 52 /utils\/config\/nodes\.hpp.*Member is_set\(void\)/ {next}
|
/freebsd-current/crypto/openssl/demos/certs/apps/ |
H A D | mkxcerts.sh | 7 -config apps.cnf -extensions usr_cert -x509 -nodes \ 10 -config apps.cnf -extensions usr_cert -x509 -nodes \ 13 -config apps.cnf -extensions usr_cert -x509 -nodes \ 22 -config apps.cnf -extensions ec_cert -x509 -nodes \ 23 -nodes -keyout tecp256.pem -out tecp256.pem -newkey ec:ecp256.pem \ 27 -config apps.cnf -extensions ec_cert -x509 -nodes \ 28 -nodes -keyout tecp384.pem -out tecp384.pem -newkey ec:ecp384.pem \
|
H A D | mkacerts.sh | 8 CN="OpenSSL Test Root CA" $OPENSSL req -config apps.cnf -x509 -nodes \ 11 CN="OpenSSL Test Intermediate CA" $OPENSSL req -config apps.cnf -nodes \ 17 CN="Test Client Cert" $OPENSSL req -config apps.cnf -nodes \ 24 CN="Test Server Cert" $OPENSSL req -config apps.cnf -nodes \ 31 CN="Test Server Cert #2" $OPENSSL req -config apps.cnf -nodes \
|
/freebsd-current/sbin/ipf/libipf/ |
H A D | printdstlist.c | 12 ipf_dstnode_t *nodes, wordtab_t *fields) 31 if (nodes == NULL) { 34 for (node = nodes; node != NULL; ) { 11 printdstlist( ippool_dst_t *pp, copyfunc_t copyfunc, char *name, int opts, ipf_dstnode_t *nodes, wordtab_t *fields) argument
|
H A D | load_dstlist.c | 17 load_dstlist(ippool_dst_t *dst, ioctlfunc_t iocfunc, ipf_dstnode_t *nodes) argument 51 printdstlist(&dest, bcopywrap, dest.ipld_name, opts, nodes, NULL); 55 for (a = nodes; a != NULL; a = a->ipfd_next)
|
/freebsd-current/sys/netpfil/ipfilter/netinet/ |
H A D | radix_ipf.c | 33 ipf_rdx_node_t nodes[2], int *); 92 /* nodes(O) - pair of ipf_rdx_node_t's to initialise with data */ 95 /* Initialise the fields in a pair of radix tree nodes according to the */ 101 buildnodes(addrfamily_t *addr, addrfamily_t *mask, ipf_rdx_node_t nodes[2]) argument 118 bzero(&nodes[0], sizeof(ipf_rdx_node_t) * 2); 119 nodes[0].maskbitcount = maskbits; 120 nodes[0].index = -1 - (ADF_OFF_BITS + maskbits); 121 nodes[0].addrkey = (u_32_t *)addr; 122 nodes[0].maskkey = (u_32_t *)mask; 123 nodes[ 321 ipf_rx_insert(ipf_rdx_head_t *head, ipf_rdx_node_t nodes[2], int *dup) argument 498 ipf_rx_addroute(ipf_rdx_head_t *head, addrfamily_t *addr, addrfamily_t *mask, ipf_rdx_node_t *nodes) argument 920 struct ipf_rdx_node nodes[2]; member in struct:myst [all...] |
/freebsd-current/contrib/ofed/librdmacm/examples/ |
H A D | cmtime.c | 102 static struct node *nodes; variable in typeref:struct:node 171 if (!zero_time(&nodes[c].times[i][0]) && 172 !zero_time(&nodes[c].times[i][1])) { 173 us = diff_us(&nodes[c].times[i][1], &nodes[c].times[i][0]); 355 nodes = calloc(sizeof *nodes, connections); 356 if (!nodes) 362 start_perf(&nodes[i], STEP_CREATE_ID); 364 ret = rdma_create_id(channel, &nodes[ [all...] |
H A D | mckey.c | 65 struct cmatest_node *nodes; member in struct:cmatest 380 test.nodes = malloc(sizeof *test.nodes * connections); 381 if (!test.nodes) { 382 printf("mckey: unable to allocate memory for test nodes\n"); 385 memset(test.nodes, 0, sizeof *test.nodes * connections); 388 test.nodes[i].id = i; 389 ret = rdma_create_id(test.channel, &test.nodes[i].cma_id, 390 &test.nodes[ [all...] |
H A D | cmatose.c | 64 struct cmatest_node *nodes; member in struct:cmatest 274 node = &test.nodes[test.conn_index++]; 375 test.nodes = malloc(sizeof *test.nodes * connections); 376 if (!test.nodes) { 377 printf("cmatose: unable to allocate memory for test nodes\n"); 380 memset(test.nodes, 0, sizeof *test.nodes * connections); 383 test.nodes[i].id = i; 386 &test.nodes[ [all...] |
H A D | udaddy.c | 62 struct cmatest_node *nodes; member in struct:cmatest 296 node = &test.nodes[test.conn_index++]; 418 test.nodes = malloc(sizeof *test.nodes * connections); 419 if (!test.nodes) { 420 printf("udaddy: unable to allocate memory for test nodes\n"); 423 memset(test.nodes, 0, sizeof *test.nodes * connections); 426 test.nodes[i].id = i; 429 &test.nodes[ [all...] |
/freebsd-current/bin/sh/ |
H A D | Makefile | 19 GENSRCS= builtins.c nodes.c syntax.c 20 GENHDRS= builtins.h nodes.h syntax.h token.h 48 nodes.c nodes.h: mknodes 57 .ORDER: nodes.c nodes.h 58 nodes.h: .NOMETA 59 nodes.c nodes.h: nodetypes nodes [all...] |
/freebsd-current/crypto/openssl/crypto/x509/ |
H A D | pcy_node.c | 28 X509_POLICY_NODE *ossl_policy_tree_find_sk(STACK_OF(X509_POLICY_NODE) *nodes, 38 idx = sk_X509_POLICY_NODE_find(nodes, &l); 39 return sk_X509_POLICY_NODE_value(nodes, idx); 49 for (i = 0; i < sk_X509_POLICY_NODE_num(level->nodes); i++) { 50 node = sk_X509_POLICY_NODE_value(level->nodes, i); 85 if (level->nodes == NULL) 86 level->nodes = ossl_policy_node_cmp_new(); 87 if (level->nodes == NULL) { 91 if (!sk_X509_POLICY_NODE_push(level->nodes, node)) { 122 (void) sk_X509_POLICY_NODE_pop(level->nodes); [all...] |
H A D | pcy_lib.c | 67 if (level->nodes) 68 n += sk_X509_POLICY_NODE_num(level->nodes); 81 return sk_X509_POLICY_NODE_value(level->nodes, i);
|
H A D | pcy_tree.c | 18 * If the maximum number of nodes in the policy tree isn't defined, set it to 19 * a generous default of 1000 nodes. 72 for (i = 0; i < sk_X509_POLICY_NODE_num(plev->nodes); i++) { 74 sk_X509_POLICY_NODE_value(plev->nodes, i); 264 /* Iterate through all in nodes linking matches */ 265 for (i = 0; i < sk_X509_POLICY_NODE_num(last->nodes); i++) { 266 X509_POLICY_NODE *node = sk_X509_POLICY_NODE_value(last->nodes, i); 296 /* Look for matching nodes in previous level */ 358 /* Locate unmatched nodes */ 382 for (i = 0; i < sk_X509_POLICY_NODE_num(last->nodes); [all...] |
/freebsd-current/crypto/openssl/crypto/ |
H A D | sparse_array.c | 55 void **nodes; member in struct:sparse_array_st 69 void *nodes[SA_BLOCK_MAX_LEVELS]; local 74 nodes[0] = sa->nodes; 77 void ** const p = nodes[l]; 90 nodes[l] = p[n]; 165 p = sa->nodes; 196 p[0] = sa->nodes; 197 sa->nodes = p; 202 p = sa->nodes; [all...] |
/freebsd-current/contrib/llvm-project/compiler-rt/lib/sanitizer_common/ |
H A D | sanitizer_stackdepotbase.h | 51 nodes.MemoryUsage() + Node::allocated(), 60 nodes.TestOnlyUnmap(); 73 TwoLevelMap<Node, kNodesSize1, kNodesSize2> nodes; member in class:__sanitizer::StackDepotBase 83 const Node &node = nodes[s]; 142 Node &new_node = nodes[s]; 156 if (!nodes.contains(id)) 158 const Node &node = nodes[id]; 172 // We still need to lock nodes. 173 nodes.Lock(); 179 nodes [all...] |
/freebsd-current/contrib/mandoc/ |
H A D | tag.c | 17 * Functions to tag syntax tree nodes. 39 struct roff_node **nodes; member in struct:tag_entry 54 * Set up the ohash table to collect nodes 73 free(entry->nodes); 142 entry->nodes = NULL; 163 nold = entry->nodes[--entry->nnodes]; 178 entry->nodes = mandoc_reallocarray(entry->nodes, 179 entry->maxnodes, sizeof(*entry->nodes)); 181 entry->nodes[entr [all...] |
/freebsd-current/crypto/openssl/demos/certs/ |
H A D | mkcerts.sh | 8 CN="Test Root CA" $OPENSSL req -config ca.cnf -x509 -nodes \ 11 CN="Test Intermediate CA" $OPENSSL req -config ca.cnf -nodes \ 18 CN="Test Server Cert" $OPENSSL req -config ca.cnf -nodes \ 25 CN="Test Client Cert" $OPENSSL req -config ca.cnf -nodes \ 32 CN="Test Revoked Cert" $OPENSSL req -config ca.cnf -nodes \ 39 CN="Test OCSP Responder Cert" $OPENSSL req -config ca.cnf -nodes \
|
/freebsd-current/contrib/llvm-project/lld/MachO/ |
H A D | ExportTrie.h | 38 std::vector<TrieNode *> nodes; member in class:lld::macho::TrieBuilder
|
/freebsd-current/contrib/bmake/unit-tests/ |
H A D | varname-dot-alltargets.mk | 20 # about all nodes, therefore source is also included.
|
/freebsd-current/usr.sbin/bluetooth/hccontrol/ |
H A D | hccontrol.c | 107 struct nodeinfo *nodes; local 110 num = find_hci_nodes(&nodes); 112 errx(7, "Could not find HCI nodes"); 115 node = lnode = strdup(nodes[0].name); 120 free(nodes); 282 /* Find all HCI nodes */ 284 find_hci_nodes(struct nodeinfo** nodes) argument 308 err(11, "Could not get list of HCI nodes"); 312 *nodes = r.names;
|
/freebsd-current/sbin/routed/ |
H A D | radix.h | 111 struct radix_node_head *head, struct radix_node nodes[]); 114 struct radix_node_head *head, struct radix_node nodes[]);
|
/freebsd-current/contrib/llvm-project/clang/utils/TableGen/ |
H A D | ASTTableGen.cpp | 53 // Type nodes are all named ending in Type, just like the corresponding 62 // Stmt nodes are named the same as the C++ class, which has no regular 94 // A map from a node to each of its child nodes. 117 // Find all the nodes in the hierarchy. 118 auto nodes = records.getAllDerivedDefinitions(nodeClassName); local 123 for (ASTNode node : nodes) { 128 "multiple root nodes in " + nodeClassName + " hierarchy");
|
/freebsd-current/contrib/bmake/ |
H A D | compat.c | 467 GNode **nodes; local 473 nodes = vec.items; 478 if (nodes[i]->type & OP_WAIT) { 479 MakeInRandomOrder(nodes + start, nodes + i, pgn); 480 Compat_Make(nodes[i], pgn); 484 MakeInRandomOrder(nodes + start, nodes + i, pgn); 739 * Expand .USE nodes right now, because they can modify the structure
|