| /src/external/mpl/bind/dist/doc/arm/_ext/ |
| namedconf.py | 18 from docutils import nodes
24 class ToBeReplacedStatementList(nodes.General, nodes.Element):
|
| rndcconf.py | 18 from docutils import nodes
24 class ToBeReplacedStatementList(nodes.General, nodes.Element):
|
| /src/external/bsd/jemalloc/dist/test/unit/ |
| rb.c | 25 /* Order used by nodes. */
35 * nodes.
41 * ordering to allow non-equal nodes that nevertheless compare equal.
176 unsigned nodes = 0; local
178 &nodes, &specialness_filter_node, &specialness_filter_subtree,
180 expect_u_eq(0, nodes, "");
182 nodes = 0;
184 &nodes, &specialness_filter_node, &specialness_filter_subtree,
186 expect_u_eq(0, nodes, "");
231 /* Red nodes must be interleaved with black nodes. *
352 node_t nodes[NNODES]; local
503 node_t nodes[FILTER_NODES]; local
929 node_t nodes[UPDATE_TEST_MAX]; local
[all...] |
| /src/external/mpl/bind/dist/bin/tests/system/selftest/ |
| tests_zone_analyzer.py | 96 def gen_node(nodes, labels):
98 nodes[name] = name2tags(name)
101 def add_ents(nodes):
103 Non-occluded nodes with 'ent' as a parent label imply existence of 'ent' nodes.
106 for name, tags in nodes.items():
124 def tag_wildcard_parents(nodes):
126 Non-occluded nodes with '*' as a leftmost label tag their immediate parent
127 nodes as 'reachable_wildcard_parents'.
129 for name, tags in nodes.items()
[all...] |
| /src/crypto/external/apache2/openssl/dist/demos/certs/apps/ |
| mkxcerts.sh | 13 -config apps.cnf -extensions usr_cert -x509 -nodes \
16 -config apps.cnf -extensions usr_cert -x509 -nodes \
19 -config apps.cnf -extensions usr_cert -x509 -nodes \
28 -config apps.cnf -extensions ec_cert -x509 -nodes \
29 -nodes -keyout tecp256.pem -out tecp256.pem -newkey ec:ecp256.pem \
33 -config apps.cnf -extensions ec_cert -x509 -nodes \
34 -nodes -keyout tecp384.pem -out tecp384.pem -newkey ec:ecp384.pem \
|
| /src/external/apache2/llvm/dist/llvm/utils/ |
| DSAextract.py | 3 #this is a script to extract given named nodes from a dot file, with
5 # x and y are both nodes specified to be kept.
19 #nodes in the file
37 <output_file> [list of nodes to extract]')
68 #for the node (it will be Node(hex number)) to our set of nodes
98 #check to make sure that both nodes are in the node list
100 nodes = arrowexp.split(buffer) variable
101 nodes[0] = string.strip(nodes[0])
102 nodes[1] = string.strip(nodes[1]
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| SpillPlacement.cpp | 73 /// value can change when linked nodes change, but convergence is very fast
98 // Undecided nodes (Value==0) go on the stack.
152 bool update(const Node nodes[], const BlockFrequency &Threshold) {
157 if (nodes[L.second].Value == -1)
159 else if (nodes[L.second].Value == 1)
182 const Node nodes[]) const {
187 if (Value != nodes[n].Value)
198 assert(!nodes && "Leaking node array");
199 nodes = new Node[bundles->getNumBundles()];
217 delete[] nodes;
[all...] |
| /src/external/gpl3/binutils/dist/include/vms/ |
| dcx.h | 46 unsigned char nodes[2]; member in struct:vms_dcxsbm
|
| /src/external/gpl3/binutils.old/dist/include/vms/ |
| dcx.h | 46 unsigned char nodes[2]; member in struct:vms_dcxsbm
|
| /src/external/gpl3/gdb/dist/include/vms/ |
| dcx.h | 46 unsigned char nodes[2]; member in struct:vms_dcxsbm
|
| /src/external/gpl3/gdb.old/dist/include/vms/ |
| dcx.h | 46 unsigned char nodes[2]; member in struct:vms_dcxsbm
|
| /src/crypto/external/bsd/openssl/dist/demos/certs/apps/ |
| 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 \
|
| /src/crypto/external/bsd/openssl.old/dist/demos/certs/apps/ |
| 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 \
|
| /src/crypto/external/bsd/openssl.old/dist/crypto/x509v3/ |
| pcy_node.c | 28 X509_POLICY_NODE *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);
80 if (level->nodes == NULL)
81 level->nodes = policy_node_cmp_new();
82 if (level->nodes == NULL) {
86 if (!sk_X509_POLICY_NODE_push(level->nodes, node)) {
|
| /src/external/bsd/ipf/dist/ |
| 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];
122 bzero(&nodes[0], sizeof(ipf_rdx_node_t) * 2);
123 nodes[0].maskbitcount = maskbits;
124 nodes[0].index = -1 - (ADF_OFF_BITS + maskbits);
125 nodes[0].addrkey = (u_32_t *)addr;
126 nodes[0].maskkey = (u_32_t *)mask
948 struct ipf_rdx_node nodes[2]; member in struct:myst
[all...] |
| /src/external/gpl3/gcc/dist/libcpp/ |
| makeuname2c.cc | 109 static struct node *root, **nodes; variable in typeref:struct:
325 /* Assumes nodes are added from sorted array, so we never
390 nodes[num_nodes++] = n;
531 nodes = (struct node **) xmalloc (num_nodes * sizeof (struct node *));
538 qsort (nodes, num_nodes, sizeof (struct node *), nodecmp);
539 if (nodes[0]->key_len >= 64)
544 "tree nodes to ensure length fits", nodes[0]->key_len);
557 if (nodes[i]->key[nodes[i]->key_len - 1] == '-
[all...] |
| /src/sys/external/bsd/ipf/netinet/ |
| radix_ipf.c | 33 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(addrfamily_t *addr, addrfamily_t *mask, ipf_rdx_node_t nodes[2])
116 bzero(&nodes[0], sizeof(ipf_rdx_node_t) * 2);
117 nodes[0].maskbitcount = maskbits;
118 nodes[0].index = -1 - (ADF_OFF_BITS + maskbits);
119 nodes[0].addrkey = (u_32_t *)addr;
120 nodes[0].maskkey = (u_32_t *)mask;
121 nodes[0].addroff = nodes[0].addrkey + masklen
919 struct ipf_rdx_node nodes[2]; member in struct:myst
[all...] |
| /src/external/gpl2/lvm2/dist/daemons/clvmd/ |
| clvmd-cman.c | 63 static struct cman_node *nodes = NULL; variable in typeref:struct:cman_node
65 static int count_nodes; /* size of allocated nodes array */
143 /* return number of ACTIVE nodes */
145 if (nodes[i].cn_member && nodes[i].cn_nodeid)
185 if (nodes[i].cn_member && nodes[i].cn_nodeid) {
186 int up = (int)(long)dm_hash_lookup_binary(node_updown_hash, (char *)&nodes[i].cn_nodeid, sizeof(int));
188 callback(client, (char *)&nodes[i].cn_nodeid, up);
296 int nodeid = nodes[i].cn_nodeid
[all...] |
| /src/external/mpl/bind/dist/tests/isc/ |
| hashmap_test.c | 73 test_node_t *nodes, *long_nodes, *upper_nodes; local
75 nodes = isc_mem_cget(mctx, count, sizeof(nodes[0]));
76 long_nodes = isc_mem_cget(mctx, count, sizeof(nodes[0]));
77 upper_nodes = isc_mem_cget(mctx, count, sizeof(nodes[0]));
88 snprintf((char *)nodes[i].key, 16, "%u", (unsigned int)i);
89 strlcat((char *)nodes[i].key, " key of a raw hashmap!!", 16);
90 nodes[i].hashval = isc_hash32(nodes[i].key, 16, true);
109 /* insert short nodes */
229 test_node_t *nodes; local
[all...] |
| /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.cp/ |
| nested-types.exp | 19 # the corresponding source file. It then walks the nodes of this tree
36 # For each node, stored as ::nodes(ID,ARG), where ARG is
42 global nodes
45 # CHILDREN is a list of nodes called [E(N), U(N)] S(N+1)
49 set nodes($id,fields) [list "int i$id" "E$id e$id" "U$id u$id"]
50 set nodes($id,children) {}
59 # We don't build nodes which are multiples of 10
61 # We also don't create nodes not in the source file
64 lappend nodes($id,children) $n
116 global nodes
[all...] |
| /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.cp/ |
| nested-types.exp | 19 # the corresponding source file. It then walks the nodes of this tree
36 # For each node, stored as ::nodes(ID,ARG), where ARG is
42 global nodes
45 # CHILDREN is a list of nodes called [E(N), U(N)] S(N+1)
49 set nodes($id,fields) [list "int i$id" "E$id e$id" "U$id u$id"]
50 set nodes($id,children) {}
59 # We don't build nodes which are multiples of 10
61 # We also don't create nodes not in the source file
64 lappend nodes($id,children) $n
116 global nodes
[all...] |
| /src/external/bsd/ipf/dist/lib/ |
| load_dstlist.c | 19 load_dstlist(dst, iocfunc, nodes)
22 ipf_dstnode_t *nodes;
56 printdstlist(&dest, bcopywrap, dest.ipld_name, opts, nodes, NULL);
60 for (a = nodes; a != NULL; a = a->ipfd_next)
|
| printdstlist.c | 13 printdstlist(pp, copyfunc, name, opts, nodes, fields)
18 ipf_dstnode_t *nodes;
38 if (nodes == NULL) {
41 for (node = nodes; node != NULL; ) {
|
| /src/crypto/external/apache2/openssl/dist/crypto/ |
| 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...] |
| /src/crypto/external/apache2/openssl/dist/crypto/x509/ |
| 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);
48 for (i = 0; i < sk_X509_POLICY_NODE_num(level->nodes); i++) {
49 node = sk_X509_POLICY_NODE_value(level->nodes, i);
82 if (level->nodes == NULL)
83 level->nodes = ossl_policy_node_cmp_new();
84 if (level->nodes == NULL) {
88 if (!sk_X509_POLICY_NODE_push(level->nodes, node)) {
119 (void)sk_X509_POLICY_NODE_pop(level->nodes);
[all...] |
