Searched refs:master (Results 1 - 25 of 30) sorted by relevance

12

/barrelfish-2018-10-04/usr/replay/
H A DMakefile4 all: replay-master replay-slave
6 replay-master: master.o
12 master.o: master.c
H A DMakefile.linux5 all: master slave
7 master: hash.c master.c defs.h hash.h
8 $(CC) $(CFLAGS) hash.c master.c -o $@
14 rm -f master slave
/barrelfish-2018-10-04/include/dist/
H A Dargs.h30 bool master; /*< this dispatcher is the master */ member in struct:dist_args
/barrelfish-2018-10-04/include/trace/
H A Dtrace.h177 struct trace_buffer *master; // Pointer to the trace master member in struct:trace_buffer
336 struct trace_buffer *master = (struct trace_buffer *)kernel_trace_buf;
342 if (!master->running) {
343 if (ev->u.raw == master->start_trigger) {
344 master->start_trigger = 0;
345 master->t0 = ev->timestamp;
346 if (master->duration)
347 master->stop_time = ev->timestamp + master
[all...]
/barrelfish-2018-10-04/lib/bomp_new/
H A Dbomp_init.c22 * - master thread stores it in global variable
24 * master threads
114 tls->r.master.nodes = calloc(node_count, sizeof(struct bomp_node));
115 if (tls->r.master.nodes == NULL) {
119 tls->r.master.num_nodes = node_count - 1;
121 tls->r.master.num_nodes = 0;
122 tls->r.master.nodes = NULL;
157 stack_size, &tls->r.master.nodes[node]);
167 stack_size, &tls->r.master.local);
169 // the master threa
[all...]
H A Dbomp.c35 node = &tls->r.master.local;
40 for (nodeid_t i = 0; i < tls->r.master.num_nodes; ++i) {
41 coreid_t num = bomp_node_exec(&tls->r.master.nodes[i], fn, data, tid_start, nthreads);
43 tls->r.master.nodes_active++;
129 struct bomp_node *node = &tls->r.master.local;
130 struct bomp_master *master = &tls->r.master; local
131 while(master->nodes_active != 1 || node->threads_active != 1) {
/barrelfish-2018-10-04/usr/mem_serv_dist/
H A Dargs.h26 bool master; member in struct:args
H A Dargs.c196 .master = false,
207 res.master = false;
210 // be a master
211 res.master = true;
/barrelfish-2018-10-04/lib/trace/
H A Dcontrol.c39 //buf->master = (struct trace_buffer *)trace_buffer_master;
56 struct trace_buffer *master = (struct trace_buffer*)trace_buffer_master; local
57 master->event_counter = 0;
90 struct trace_buffer *master = (struct trace_buffer*)trace_buffer_master; local
91 //struct trace_buffer *master = buf->master;
93 master->running = false;
94 master->stop_trigger = stop_trigger;
95 master->duration = duration;
96 master
114 struct trace_buffer *master = (struct trace_buffer*)trace_buffer_master; local
183 struct trace_buffer *master = (struct trace_buffer*)trace_buffer_master; local
332 struct trace_buffer *master = (struct trace_buffer*)trace_buffer_master; local
500 struct trace_buffer *master = (struct trace_buffer*) trace_buffer_master; local
[all...]
/barrelfish-2018-10-04/tools/aarch64_gem5/
H A Dgem5script.py129 system.bridge.master = system.iobus.slave
130 system.bridge.slave = system.membus.master
137 #system.ramdisk.port = system.membus.master
148 system.realview.nvmem.port = system.membus.master
166 system.physmem.port = system.membus.master
174 system.iocache.cpu_side = system.iobus.master
179 system.iobridge.slave = system.iobus.master
180 system.iobridge.master = system.membus.slave
H A DCacheConfig.py45 system.l2.cpu_side = system.tol2bus.master
/barrelfish-2018-10-04/usr/routing_setup/
H A Drts.c146 // this is a master node --> always route to the master of a socket...
157 // this node is not the master of a socket
159 // current master node
160 coreid_t master = i - (i % cores_per_socket); local
162 // we always route to our master...
164 routing_table[i][j] = master;
168 for (coreid_t j = master; j < master + cores_per_socket; j++) {
/barrelfish-2018-10-04/usr/bench/bomp_progress/
H A Dsync.c74 #pragma omp master
/barrelfish-2018-10-04/lib/dist/
H A Dargs.c198 .master = false,
212 res.master = false;
215 // be a master
216 res.master = true;
H A Dstart.c35 debug_printf("rmw: %s master on core %d\n", name, core);
89 DEBUG_ERR(err, "barrier master failed");
156 if (d_args->master) {
/barrelfish-2018-10-04/usr/bench/bomp_benchmark/
H A Dft.c162 #pragma omp master
166 #pragma omp master
171 #pragma omp master
177 #pragma omp master
184 #pragma omp master
188 #pragma omp master
195 #pragma omp master
199 #pragma omp master
206 #pragma omp master
215 #pragma omp master
[all...]
H A Dis.c382 #pragma omp master
430 #pragma omp master
578 } /* end master */
657 //#pragma omp master
663 #pragma omp master
H A Dep.c213 #pragma omp master
H A Dcg.c301 #pragma omp master
307 } /* end master */
319 #pragma omp master
/barrelfish-2018-10-04/lib/bomp_new/include/
H A Dbomp_internal.h42 BOMP_NODE_MASTER, ///< this is the program master node
51 BOMP_THREAD_ROLE_MASTER ///< Program master thread (initial thread)
95 * \brief stores the state of the BOMP master thread
97 * The BOMP master thread is also a node coordinator of its own node.
121 struct bomp_master master; member in union:bomp_tls::__anon525
/barrelfish-2018-10-04/usr/tests/bomptest/
H A Dprogress.c87 #pragma omp master
/barrelfish-2018-10-04/include/vm/
H A Duma.h198 * when creating a master zone. These zinit/zfini are called
203 * zinit/zfini (unset by default for master zone) with
206 * master A reference to this zone's Master Zone (Primary Zone),
215 uma_init zinit, uma_fini zfini, uma_zone_t master);
218 * Add a second master to a secondary zone. This provides multiple data
226 int uma_zsecond_add(uma_zone_t zone, uma_zone_t master);
H A Duma_core.c1420 * The master zone is passed to us at keg-creation time.
1939 uma_init zinit, uma_fini zfini, uma_zone_t master)
1946 keg = zone_first_keg(master);
2016 uma_zsecond_add(uma_zone_t zone, uma_zone_t master) argument
2025 zone_lock_pair(zone, master);
2036 * The new master must also use vtoslab().
2047 if (master->uz_size != zone->uz_size) {
2054 klink->kl_keg = zone_first_keg(master);
2066 zone_unlock_pair(zone, master);
1938 uma_zsecond_create(char *name, uma_ctor ctor, uma_dtor dtor, uma_init zinit, uma_fini zfini, uma_zone_t master) argument
/barrelfish-2018-10-04/usr/eclipseclp/documents/tutorial/
H A Dcolgen.tex168 The cutting stock problem can be decomposed into a master problem in which an optimum combination of existing cuttings is found and a subproblem in which new cuttings are generated which could improve upon the current combination. For clarity we denote by $Q$ the set of feasible cuttings and index variables $\lambda_{\mathbf{q}}$ by the column of master problem constraint coefficients $\mathbf{q}\in Q$ corresponding to the equivalent subproblem solution:
204 % master problem column generation constraint
209 % master problem initial lower and upper bound constraints
230 where we first create a {\tt colgen} instance {\tt cut\_stock}, set up the variable domains of the subproblem and the demand constraints of the master problem, set up the initial master problem bound constraints and subproblem knapsack constraint, then solve and return the variables with non-zero values in the optimal solution. The definition of cutting cost as waste has been combined with the knapsack constraint, while the bounds placed on this cost exclude cuttings with sufficient waste to produce further boards, thus limiting the amount of search in subproblem solution. The chosen method of subproblem solution is:
280 it to the master problem instance.
/barrelfish-2018-10-04/lib/libc/gen/
H A Dgetpwent.c1218 * Test for the presence of special FreeBSD-specific master.passwd.by*
1222 * the master.passwd.by* maps don't exist, then let the lookup routine try
1228 int *master)
1232 *master = 0;
1234 if (snprintf(buffer, bufsize, "master.passwd.by%s",
1239 *master = 1;
1310 int *errnop, keylen, resultlen, rv, master; local
1338 rv = nis_map(st->domain, how, map, sizeof(map), &master);
1404 rv = __pw_parse_entry(buffer, resultlen, pwd, master,
2003 int master, in
1227 nis_map(char *domain, enum nss_lookup_type how, char *buffer, size_t bufsize, int *master) argument
2002 __pw_parse_entry(char *buffer, size_t bufsize __unused, struct passwd *pwd, int master, int *errnop __unused) argument
[all...]

Completed in 111 milliseconds

12