/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | SpillPlacement.cpp | 77 /// value can change when linked nodes change, but convergence is very fast 102 // Undecided nodes (Value==0) go on the stack. 156 bool update(const Node nodes[], const BlockFrequency &Threshold) { argument 161 if (nodes[I->second].Value == -1) 163 else if (nodes[I->second].Value == 1) 186 const Node nodes[]) const { 191 if (Value != nodes[n].Value) 202 assert(!nodes && "Leaking node array"); 203 nodes = new Node[bundles->getNumBundles()]; 221 delete[] nodes; [all...] |
/freebsd-11-stable/crypto/openssl/crypto/x509v3/ |
H A D | pcy_node.c | 77 X509_POLICY_NODE *tree_find_sk(STACK_OF(X509_POLICY_NODE) *nodes, 87 idx = sk_X509_POLICY_NODE_find(nodes, &l); 91 return sk_X509_POLICY_NODE_value(nodes, idx); 101 for (i = 0; i < sk_X509_POLICY_NODE_num(level->nodes); i++) { 102 node = sk_X509_POLICY_NODE_value(level->nodes, i); 130 if (!level->nodes) 131 level->nodes = policy_node_cmp_new(); 132 if (!level->nodes) 134 if (!sk_X509_POLICY_NODE_push(level->nodes, node))
|
H A D | pcy_lib.c | 117 if (level->nodes) 118 n += sk_X509_POLICY_NODE_num(level->nodes); 131 return sk_X509_POLICY_NODE_value(level->nodes, i);
|
H A D | pcy_tree.c | 115 for (i = 0; i < sk_X509_POLICY_NODE_num(plev->nodes); i++) { 116 node = sk_X509_POLICY_NODE_value(plev->nodes, i); 312 /* Iterate through all in nodes linking matches */ 313 for (i = 0; i < sk_X509_POLICY_NODE_num(last->nodes); i++) { 314 node = sk_X509_POLICY_NODE_value(last->nodes, i); 354 /* Look for matching nodes in previous level */ 413 /* Locate unmatched nodes */ 439 for (i = 0; i < sk_X509_POLICY_NODE_num(last->nodes); i++) { 440 node = sk_X509_POLICY_NODE_value(last->nodes, i); 448 * Skip any node with any children: we only want unmathced nodes [all...] |
/freebsd-11-stable/bin/sh/ |
H A D | Makefile | 14 GENSRCS= builtins.c nodes.c syntax.c 15 GENHDRS= builtins.h nodes.h syntax.h token.h 54 .ORDER: nodes.c nodes.h 55 nodes.h: .NOMETA 56 nodes.c nodes.h: mknodes nodetypes nodes.c.pat 57 ${BTOOLSPATH:U.}/mknodes ${.CURDIR}/nodetypes ${.CURDIR}/nodes.c.pat
|
/freebsd-11-stable/contrib/ipfilter/ |
H A D | radix_ipf.c | 31 ipf_rdx_node_t nodes[2], int *); 90 /* nodes(O) - pair of ipf_rdx_node_t's to initialise with data */ 93 /* Initialise the fields in a pair of radix tree nodes according to the */ 99 buildnodes(addr, mask, nodes) 101 ipf_rdx_node_t nodes[2]; 120 bzero(&nodes[0], sizeof(ipf_rdx_node_t) * 2); 121 nodes[0].maskbitcount = maskbits; 122 nodes[0].index = -1 - (ADF_OFF_BITS + maskbits); 123 nodes[0].addrkey = (u_32_t *)addr; 124 nodes[ 946 struct ipf_rdx_node nodes[2]; member in struct:myst [all...] |
/freebsd-11-stable/sys/contrib/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(addr, mask, nodes) 103 ipf_rdx_node_t nodes[2]; 120 bzero(&nodes[0], sizeof(ipf_rdx_node_t) * 2); 121 nodes[0].maskbitcount = maskbits; 122 nodes[0].index = -1 - (ADF_OFF_BITS + maskbits); 123 nodes[0].addrkey = (u_32_t *)addr; 124 nodes[ 946 struct ipf_rdx_node nodes[2]; member in struct:myst [all...] |
/freebsd-11-stable/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-11-stable/contrib/subversion/subversion/libsvn_fs_base/bdb/ |
H A D | nodes-table.c | 0 /* nodes-table.c : working with the `nodes' table 40 #include "nodes-table.h" 47 /* Opening/creating the `nodes' table. */ 56 DB *nodes; 59 BDB_ERR(db_create(&nodes, env, 0)); 60 BDB_ERR((nodes->open)(SVN_BDB_OPEN_PARAMS(nodes, NULL), 61 "nodes", 0, DB_BTREE, 70 BDB_ERR(nodes 55 DB *nodes; local [all...] |
/freebsd-11-stable/contrib/ipfilter/lib/ |
H A D | load_dstlist.c | 17 load_dstlist(dst, iocfunc, nodes) 20 ipf_dstnode_t *nodes; 54 printdstlist(&dest, bcopywrap, dest.ipld_name, opts, nodes, NULL); 58 for (a = nodes; a != NULL; a = a->ipfd_next)
|
H A D | printdstlist.c | 11 printdstlist(pp, copyfunc, name, opts, nodes, fields) 16 ipf_dstnode_t *nodes; 36 if (nodes == NULL) { 39 for (node = nodes; node != NULL; ) {
|
/freebsd-11-stable/contrib/subversion/subversion/libsvn_wc/ |
H A D | wc-queries.sql | 34 FROM nodes 39 SELECT op_depth, nodes.repos_id, nodes.repos_path, presence, kind, revision, 47 FROM nodes 48 LEFT OUTER JOIN lock ON nodes.repos_id = lock.repos_id 49 AND nodes.repos_path = lock.repos_relpath AND nodes.op_depth=0 57 FROM nodes 61 SELECT nodes.repos_id, nodes [all...] |
H A D | wc-checks.sql | 37 CREATE TEMPORARY TRIGGER validation_01 BEFORE INSERT ON nodes 46 CREATE TEMPORARY TRIGGER validation_02 BEFORE INSERT ON nodes 54 CREATE TEMPORARY TRIGGER validation_03 BEFORE INSERT ON nodes 58 (EXISTS (SELECT 1 FROM nodes 71 OR EXISTS (SELECT 1 FROM nodes 80 FROM nodes n WHERE local_relpath != '' 95 /* All ACTUAL nodes must have an equivalent NODE in NODES 99 AND NOT EXISTS(SELECT 1 from nodes i 102 AND NOT EXISTS(SELECT 1 from nodes i 111 LEFT JOIN nodes [all...] |
/freebsd-11-stable/contrib/gcc/ |
H A D | ddg.c | 271 if (df_find_use (df, g->nodes[i].insn, rd->reg)) 304 if (df_find_def (df, g->nodes[i].insn, use->reg)) 347 /* Given two nodes, analyze their RTL insns and add inter-loop mem deps 372 /* Perform intra-block Data Dependency analysis and connect the nodes in 394 ddg_node_ptr dest_node = &g->nodes[i]; 419 ddg_node_ptr j_node = &g->nodes[j]; 472 /* Allocate the nodes array, and initialize the nodes. */ 474 g->nodes = (ddg_node_ptr) xcalloc (num_nodes, sizeof (struct ddg_node)); 491 g->closing_branch = &g->nodes[ 694 create_scc(ddg_ptr g, sbitmap nodes) argument 991 update_dist_to_successors(ddg_node_ptr u_node, sbitmap nodes, sbitmap tmp) argument 1017 longest_simple_path(struct ddg * g, int src, int dest, sbitmap nodes) argument [all...] |
H A D | tree-dump.h | 69 /* The first node in the queue of nodes to be written out. */ 73 /* Free queue nodes. */ 75 /* The tree nodes which we have already written out. The 76 keys are the addresses of the nodes; the values are the integer 78 splay_tree nodes; member in struct:dump_info
|
H A D | ddg.h | 85 /* The source and destination nodes of the dependency edge. */ 126 /* This array holds the nodes in the graph; it is indexed by the node 128 ddg_node_ptr nodes; member in struct:ddg 148 /* A bitmap that represents the nodes of the DDG that are in the SCC. */ member in struct:ddg_scc 149 sbitmap nodes;
|
/freebsd-11-stable/contrib/libgnuregex/ |
H A D | regex_internal.c | 25 const re_node_set *nodes, 28 const re_node_set *nodes, 1407 /* Add the token TOKEN to dfa->nodes, and return the index of the token. 1429 new_nodes = re_realloc (dfa->nodes, re_token_t, new_nodes_alloc); 1432 dfa->nodes = new_nodes; 1446 dfa->nodes[dfa->nodes_len] = token; 1447 dfa->nodes[dfa->nodes_len].constraint = 0; 1449 dfa->nodes[dfa->nodes_len].accept_mb = 1460 calc_state_hash (const re_node_set *nodes, unsigned int context) 1462 unsigned int hash = nodes 1457 calc_state_hash(const re_node_set *nodes, unsigned int context) argument 1477 re_acquire_state(reg_errcode_t *err, const re_dfa_t *dfa, const re_node_set *nodes) argument 1521 re_acquire_state_context(reg_errcode_t *err, const re_dfa_t *dfa, const re_node_set *nodes, unsigned int context) argument 1613 create_ci_newstate(const re_dfa_t *dfa, const re_node_set *nodes, unsigned int hash) argument 1663 create_cd_newstate(const re_dfa_t *dfa, const re_node_set *nodes, unsigned int context, unsigned int hash) argument [all...] |
/freebsd-11-stable/contrib/gcclibs/include/ |
H A D | fibheap.h | 49 size_t nodes; member in struct:fibheap
|
/freebsd-11-stable/contrib/gdb/include/ |
H A D | fibheap.h | 49 size_t nodes; member in struct:fibheap
|
/freebsd-11-stable/contrib/binutils/include/ |
H A D | fibheap.h | 49 size_t nodes; member in struct:fibheap
|
/freebsd-11-stable/usr.sbin/bluetooth/hccontrol/ |
H A D | hccontrol.c | 107 struct nodeinfo *nodes; local 109 num = find_hci_nodes(&nodes); 111 errx(7, "Could not find HCI nodes"); 114 node = strdup(nodes[0].name); 119 free(nodes); 280 /* Find all HCI nodes */ 282 find_hci_nodes(struct nodeinfo** nodes) argument 306 err(11, "Could not get list of HCI nodes"); 310 *nodes = r.names;
|
/freebsd-11-stable/crypto/openssl/util/ |
H A D | mkcerts.sh | 23 -out pca-req.pem -nodes >/dev/null <<EOF 59 -out ca-req.pem -nodes >/dev/null <<EOF 96 -out s512-req.pem -nodes >/dev/null <<EOF 133 -out s1024req.pem -nodes >/dev/null <<EOF 170 -out c512-req.pem -nodes >/dev/null <<EOF
|