Searched refs:nodes (Results 1 - 25 of 49) sorted by relevance

12

/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/x509v3/
H A Dpcy_node.c76 X509_POLICY_NODE *tree_find_sk(STACK_OF(X509_POLICY_NODE) *nodes,
86 idx = sk_X509_POLICY_NODE_find(nodes, &l);
90 return sk_X509_POLICY_NODE_value(nodes, idx);
100 for (i = 0; i < sk_X509_POLICY_NODE_num(level->nodes); i++)
102 node = sk_X509_POLICY_NODE_value(level->nodes, i);
135 if (!level->nodes)
136 level->nodes = policy_node_cmp_new();
137 if (!level->nodes)
139 if (!sk_X509_POLICY_NODE_push(level->nodes, node))
H A Dpcy_lib.c115 if (level->nodes)
116 n += sk_X509_POLICY_NODE_num(level->nodes);
130 return sk_X509_POLICY_NODE_value(level->nodes, i);
H A Dpcy_tree.c114 for (i = 0; i < sk_X509_POLICY_NODE_num(plev->nodes); i++)
116 node = sk_X509_POLICY_NODE_value(plev->nodes, i);
316 /* Iterate through all in nodes linking matches */
317 for (i = 0; i < sk_X509_POLICY_NODE_num(last->nodes); i++)
319 node = sk_X509_POLICY_NODE_value(last->nodes, i);
362 /* Look for matching nodes in previous level */
426 /* Locate unmatched nodes */
451 for (i = 0; i < sk_X509_POLICY_NODE_num(last->nodes); i++)
453 node = sk_X509_POLICY_NODE_value(last->nodes, i);
461 * nodes
[all...]
H A Dpcy_int.h132 /* This structure represents the relationship between nodes */
140 /* Number of child nodes */
148 /* nodes at this level */
149 STACK_OF(X509_POLICY_NODE) *nodes; member in struct:X509_POLICY_LEVEL_st
162 /* Extra policy data when additional nodes (not from the certificate)
/barrelfish-2018-10-04/lib/numa/
H A Dutilities.c33 if (topology->nodes == NULL) {
46 struct numa_node *node = &topology->nodes[nodeid];
108 "writeln(num(nodes(Nnodes),cores(Ncores))),"
117 err = skb_read_output("num(nodes(%d), cores(%d))", &node, &core);
122 NUMA_DEBUG_INIT("discovered topology with %" PRIuNODEID " nodes, %" PRIuCOREID
126 NUMA_ERROR("invalid number of cores %" PRIu32 " or nodes %" PRIu32 ".",
132 NUMA_ERROR("too large number of cores %" PRIu32 " or nodes %" PRIu32 ".",
143 topology->nodes = malloc(node * sizeof(struct numa_node)
147 if (topology->nodes == NULL) {
151 struct numa_core *cores_array = (struct numa_core *)(topology->nodes
[all...]
H A Dnuma.c28 * \brief bitmask that is allocated by the library with bits representing all nodes
99 bitmap_set_bit(numa_all_nodes_ptr, numa_topology.nodes[i].id);
156 // XXX: assume nodes are 0..n-1
199 * \brief Obtains the number of all memory nodes in the system
201 * \return number of memory nodes in the system
203 * returns the number of memory nodes in the system. This count includes any nodes
210 // XXX: we have all nodes configures
215 * \brief obtains the nodes the domain is allowed to allocate memory from
217 * \returns bitmask representing the allowing nodes
[all...]
H A Dalloc.c98 * \param nodemask bitmask representing the nodes
100 * All new memory allocations are page interleaved over all nodes in the interleave
103 * This bitmask is considered to be a hint. Fallback to other nodes may be possible
120 /* clear out the invalid nodes */
130 * \brief binds the current task and its children to the nodes specified in nodemask.
132 * \param nodemask bitmap representing the nodes
158 * \param nodemask bitmap representing the nodes
160 * The task will only allocate memory from the nodes set in nodemask.
162 * an empty mask or not allowed nodes in the mask will result in an error
184 /* cannot bind to no node, restore with all nodes pointe
329 nodeid_t nodes = bitmap_get_weight(nodemask); local
539 numa_move_pages(domainid_t did, size_t count, void **pages, const nodeid_t *nodes, errval_t *status, int flags) argument
[all...]
H A Dnuma_internal.h46 nodeid_t num_nodes; ///< number of nodes in the system
53 struct numa_node *nodes; ///< nodes in the system member in struct:numa_topology
135 NUMA_WARNING("Node ID exceeds number of available nodes: %" PRIuNODEID "/%" \
/barrelfish-2018-10-04/tools/
H A Dcreate_mdb_dot.py90 # nodes is map of kernel addr to cap
91 nodes = {}
97 nodes[int(kaddr, 0)] = Capability(cap)
98 return nodes
140 # generate nodes
141 f.write(" // list of all nodes\n")
175 nodes = parse_file(sys.argv[1]) variable
176 treeroot = build_tree(nodes)
181 write_dot_file(nodes, treeroot, outf)
/barrelfish-2018-10-04/lib/bomp_new/
H A Dbomp_init.c21 * - nodes and worker store their local state in the TLS or binding
25 * - list of nodes -> execute on
75 /* determine the number of needed nodes */
100 BOMP_DEBUG_INIT("Initializing BOMP with a %" PRIuNODEID " nodes of %" PRIuCOREID
114 tls->r.master.nodes = calloc(node_count, sizeof(struct bomp_node));
115 if (tls->r.master.nodes == NULL) {
122 tls->r.master.nodes = NULL;
131 // divide the threads equally among the nodes
157 stack_size, &tls->r.master.nodes[node]);
H A Dbomp.c41 coreid_t num = bomp_node_exec(&tls->r.master.nodes[i], fn, data, tid_start, nthreads);
/barrelfish-2018-10-04/usr/eclipseclp/icparc_solvers/
H A Dvbs_data.pl103 % The list of nodes in the graph - node( node_list ).
105 nodes(
115 % The goegraphical location of the nodes - node( id, x-coord, y-coord ).
148 % The in-out nodes for each node in the network
/barrelfish-2018-10-04/lib/openssl-1.0.0d/util/
H A Dmkcerts.sh23 -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
/barrelfish-2018-10-04/lib/openssl-1.0.0d/demos/ssltest-ecc/
H A DECCcertgen.sh56 # WARNING: By using the -nodes option, we force the private key to be
58 $OPENSSL_CMD req $OPENSSL_CNF -nodes -subj "$TEST_CA_DN" \
94 # WARNING: By using the -nodes option, we force the private key to be
96 $OPENSSL_CMD req $OPENSSL_CNF -nodes -subj "$TEST_SERVER_DN" \
133 # WARNING: By using the -nodes option, we force the private key to be
135 $OPENSSL_CMD req $OPENSSL_CNF -nodes -subj "$TEST_CLIENT_DN" \
H A DRSAcertgen.sh49 $OPENSSL_CMD req $OPENSSL_CNF -nodes -subj "$TEST_CA_DN" \
75 $OPENSSL_CMD req $OPENSSL_CNF -nodes -subj "$TEST_SERVER_DN" \
100 $OPENSSL_CMD req $OPENSSL_CNF -nodes -subj "$TEST_CLIENT_DN" \
H A DECC-RSAcertgen.sh51 $OPENSSL_CMD req $OPENSSL_CNF -nodes -subj "$TEST_SERVER_DN" \
77 $OPENSSL_CMD req $OPENSSL_CNF -nodes -subj "$TEST_CLIENT_DN" \
/barrelfish-2018-10-04/usr/skb/programs/
H A Ddb_partitions.pl10 %% on same nodes
11 %% 2.: Ignore and just return the same number of partitions as there are NUMA nodes
/barrelfish-2018-10-04/lib/openssl-1.0.0d/apps/
H A DCA.pl8 # 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";
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
H A DCA.pl.bak8 # 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";
H A DCA.pl.in8 # 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";
/barrelfish-2018-10-04/lib/bomp_new/include/
H A Dbomp_internal.h100 nodeid_t num_nodes; ///< the number of nodes in the system
101 struct bomp_node *nodes; ///< array of nodes to other member in struct:bomp_master
/barrelfish-2018-10-04/doc/006-routing/
H A DRouting.tex109 also require communication among a group of nodes.
110 A group of nodes that want to come to agreement on some value
116 The sender sends the message to a subset of nodes it wishes to communicate with.
117 The subset will in turn forward it to the remaining set of nodes.
128 Multi-hop messaging is an important part of the routing layer. It gives applications a possibility to create a logical channel between two cores, that is routed over multiple nodes. This requires that available ICD links are multiplexed.
130 A multi-hop channel can only be set up between two dispatchers running on different cores. It always leads through the two monitors running on each dispatcher's core. Between those two monitors the multi-hop channel can lead through an arbitrary number of additional monitors. We call all the monitors that lie on a multi-hop channel \emph{nodes}. All the nodes of a multi-hop channel must be connected by means of other ICD-links (such as LMP or UMP ICD-links).
132 Once a multi-hop channel is set up, it can be used to exchange messages between the two dispatchers. The multi-hop channel transports messages by passing them to the underlying interconnect driver on each link between the nodes of the multi-hop channel.
146 The multi-hop interconnect driver was designed to be independent of the type of the underlying ICD links between the nodes on the multi-hop channel. This means that it uses the common flounder interface supported by all ICDs when interacting with the underlying ICD link and uses no ICD-specific knowledge. This design involves a performance penalty: Interacting directly with the underlying ICDs instead of via the common flounder-interface would certainly perform better. Nevertheless, we chose this design, as it gives us more flexibility: The multi-hop interconnect channel can run over all present and future interconnect drivers in Barrelfish, as long as they support the common flounder interface.
159 We use virtual circuit switching in order to multiplex multiple multi-hop channels over the available ICD links. Virtual circuit switching has several advantages over a packed-switched approach. It ensures that all messages take the same path and thereby FIFO delivery of messages (as long as the underlying ICD links provide FIFO delivery). Moreover, it allows to create per-circuit state on the nodes o
[all...]
/barrelfish-2018-10-04/include/
H A Dnuma.h29 ///< the maximum number of nodes supported
95 * \brief Obtains the maximum number of nodes the system can handle
97 * \return maximum nodes supported
108 * \brief Obtains the number of all memory nodes in the system
110 * \return number of memory nodes in the system
112 * returns the number of memory nodes in the system. This count includes any nodes
118 * \brief obtains the nodes the domain is allowed to allocate memory from
120 * \returns bitmask representing the allowing nodes
122 * returns the mask of nodes fro
[all...]
/barrelfish-2018-10-04/lib/openssl-1.0.0d/test/
H A Dtesttsa48 ../../util/shlib_wrap.sh ../../apps/openssl req -new -x509 -nodes \

Completed in 619 milliseconds

12