Searched refs:set (Results 1 - 25 of 323) sorted by last modified time

1234567891011>>

/barrelfish-2018-10-04/usr/vmkitmon/
H A Dlpc.h185 uint8_t set : 1; ///< Update Cycle Inhibit member in struct:lpc_rtc_b::__anon1817
H A Dlpc.c105 // Can set interrupt window here to cause a VM-exit as soon as the
403 assert(l->rtc_prim_ram.u.B.u.set == 0);
477 // set the out pin to high
491 // we do not set the out pin to one for one cycle as it would be on
526 // set up the new timer
731 // set the access mode
/barrelfish-2018-10-04/usr/tests/posixcompat/
H A Dpthreads.c78 cpu_set_t set; local
84 CPU_ZERO(&set);
85 CPU_SET(rep, &set);
86 pthread_attr_setaffinity_np(&attr, sizeof(cpu_set_t), &set);
135 cpu_set_t set; local
139 CPU_ZERO(&set);
140 CPU_SET(rep, &set);
141 pthread_attr_setaffinity_np(&attr, sizeof(cpu_set_t), &set);
/barrelfish-2018-10-04/usr/tests/octopus/
H A Dd2bench2.c3 * \brief Benchmarking random workload for get/set queries with no
156 cl->call_seq.set(cl, buf, SET_SEQUENTIAL, NOP_TRIGGER, false, &record, &tid, &error_code);
157 if(err_is_fail(error_code)) { DEBUG_ERR(error_code, "set"); exit(0); }
H A Dd2bench.c52 DEBUG_ERR(err, "set");
107 cl->call_seq.set(cl, record, SET_SEQUENTIAL, NOP_TRIGGER, false, &ret, &tid, &error_code);
117 cl->call_seq.set(cl, to_add, SET_DEFAULT, NOP_TRIGGER, false, &data, &tid, &error_code);
120 DEBUG_ERR(error_code, "set");
H A Dd2bench1.c3 * \brief Benchmark get/set throughput.
28 * Usage: d2bench1 <#clients> <get|set>
65 else if (strcmp(argv[2], "set") == 0) {
67 cl->call_seq.set(cl, record, SET_DEFAULT, NOP_TRIGGER, false, &reply, &tid, &error_code);
69 //DEBUG_ERR(error_code, "set record");
/barrelfish-2018-10-04/usr/skb/programs/
H A Dscheduler.pl45 % set the max #cores a sync thread can use to the max #hwcores available
H A Dirq_routing_new.pl109 % It is not possible to directly set constraints on bit fields in IC
H A Dglobalthreadalloc.pl294 % max nr threads set according to stored data:
596 % set the working set size per core
597 % This helps deciding whether the sum of the working set of all cores
H A Ddecoding_net.pl190 %% Extract blocks from translate set
/barrelfish-2018-10-04/usr/skb/octopus/
H A Dskiplist.c124 * \brief Create a skip set.
146 * \brief Print elements in set.
197 * \note The skip list is actually a set. So
327 struct skip_list* set = sets[j]; local
330 for(int64_t k = set->level; k >= 0; k--) {
/barrelfish-2018-10-04/usr/monitor/
H A Doctopus_client.c90 err = orpc->rpc_tx_vtbl.set(orpc, mapping, SET_DEFAULT, NOP_TRIGGER, false,
/barrelfish-2018-10-04/usr/monitor/include/
H A Dcapsend.h29 coreid_t *set; member in struct:capsend_destset
/barrelfish-2018-10-04/usr/monitor/capops/
H A Dcapsend.c173 if (dests && dests->set == NULL) {
174 dests->set = calloc(dest_count, sizeof(coreid_t));
195 // if we're initializing destination set, add destination
196 // cores that we were able to enqueue msg for to set.
197 dests->set[dests->count++] = dest;
218 coreid_t dest = dests->set[i];
/barrelfish-2018-10-04/usr/eclipseclp/icparc_solvers/
H A Drepair.pl33 % because intially when the problem is being set up we don't want to
35 % value hasn't been set yet.
100 mon, % set element with suspension of monitor_tenable goal
149 assignment. Search algorithms can then access the set of
159 To do so, set up a viewable using viewable:viewable_create/3,4 and specify
275 % The conflict vars set is those variables that are untenable. All of these
278 % The conflict constraints set contains constraints that are untenable.
280 % constraint into the conflict vars set.
282 % variables are set to their tentative values.
284 % that its delayed goals list is exactly the conflict constraint set
[all...]
H A Dprobing_tests.pl195 %%% Information specific to this data set
H A Dprobe_support.pl178 set by this propagation.
H A Dprobing_for_scheduling.pl393 This predicate finds start times for a set of tasks, which
H A Dprobe.pl213 The counter can be set using <B>set_probect(N)</B>, and can be read using
219 summary : "Sets up a linear probe for a set of constraints",
237 <B>lp_demon_setup</B> is then invoked to set up the linear solver, with the
H A Dprobe_search.pl91 variable, it is simply set to its minimum value. In this case the
144 previous probe) that must be set to zero to achieve feasibility.
220 the "tightest" one that would still have to be set to zero even if we
249 Select the "tightest" binary variable that would still have to be set
272 minimum you would have to "push" the tasks to set the overlap
H A Dmake_overlap_bivs.pl36 In principle a bivalued variable is set up between each pair of tasks.
37 This variable will be set to the amount of resource used by the second
39 If not, the variable will be set to zero. The sum of these variables
98 is set up, (since the value would be zero). If the tasks do
99 overlap, the bivalued variable is set to the amount of resource needed by the
212 summary: "Make a set of overlap bivalued variables for a set of tasks.
213 Introduce a set of 'bivalued sum' variables, equal to the sum of the binaries at
H A Dic_probing_for_scheduling.pl393 This predicate finds start times for a set of tasks, which
H A Dic_probing_tests.pl197 %%% Information specific to this data set
H A Dic_probe_support.pl179 set by this propagation.
H A Dic_probe.pl214 The counter can be set using <B>set_probect(N)</B>, and can be read using
220 summary : "Sets up a linear probe for a set of constraints",
238 <B>lp_demon_setup</B> is then invoked to set up the linear solver, with the

Completed in 214 milliseconds

1234567891011>>