| /src/external/mit/isl/dist/ |
| isl_schedule_node_private.h | 8 /* An isl_schedule_node points to a particular location in a schedule tree.
10 * "schedule" is the schedule that the node is pointing to.
13 * The first ancestor is the root of "schedule", while the last ancestor
21 * in a schedule tree and therefore does not uniquely identify a position
22 * in the schedule tree.
27 isl_schedule *schedule; member in struct:isl_schedule_node
34 __isl_take isl_schedule *schedule, __isl_take isl_schedule_tree *tree,
|
| schedule.c | 10 * prints a schedule that satisfies those constraints.
15 #include <isl/schedule.h>
23 isl_schedule *schedule; local
31 schedule = isl_schedule_constraints_compute_schedule(sc);
35 p = isl_printer_print_schedule(p, schedule);
38 isl_schedule_free(schedule);
|
| isl_schedule.c | 19 #include <isl/schedule.h>
27 /* Return a schedule encapsulating the given schedule tree.
29 * We currently only allow schedule trees with a domain or extension as root.
32 * used to represent leaves in the constructed schedule.
35 * these leaves to ensure that they are only used while the schedule
42 isl_schedule *schedule; local
50 "root of schedule tree should be a domain or extension",
53 schedule = isl_calloc_type(ctx, isl_schedule);
54 if (!schedule)
[all...] |
| isl_test_cpp-checked.cc | 180 /* Test basic schedule tree functionality.
182 * In particular, create a simple schedule tree and
237 /* Test basic AST generation from a schedule tree.
239 * In particular, create a simple schedule tree and
245 auto schedule = test_ast_build_generic(ctx); local
257 auto ast = build.node_from(schedule);
268 ast = build_copy.node_from(schedule);
273 ast = build.node_from(schedule);
288 * - Schedule trees
|
| isl_test_cpp-generic.cc | 237 /* Construct a simple schedule tree with an outer sequence node and
241 static isl::schedule construct_schedule_tree(isl::ctx ctx)
267 return node.schedule();
270 /* Test basic schedule tree functionality that is independent
273 * In particular, create a simple schedule tree and
280 auto schedule = construct_schedule_tree(ctx); local
281 auto root = schedule.root();
298 * "schedule" is the schedule created by construct_schedule_tree.
303 static void test_ast_build_unroll(isl::schedule schedule
338 auto schedule = construct_schedule_tree(ctx); local
[all...] |
| isl_test_cpp.cc | 202 /* Test basic schedule tree functionality.
204 * In particular, create a simple schedule tree and
275 /* Test basic AST generation from a schedule tree.
277 * In particular, create a simple schedule tree and
283 auto schedule = test_ast_build_generic(ctx); local
299 auto ast = build.node_from(schedule);
313 auto ast = build_copy.node_from(schedule);
317 ast = build.node_from(schedule);
353 * - Schedule trees
|
| isl_schedule_read.c | 3 #include <isl/schedule.h>
9 * of a schedule.
48 [isl_schedule_key_schedule] = "schedule",
497 isl_multi_union_pw_aff *schedule = NULL; local
520 schedule = isl_multi_union_pw_aff_free(schedule);
527 schedule = isl_multi_union_pw_aff_read_from_str(ctx,
531 if (!schedule)
569 if (!schedule)
570 isl_die(ctx, isl_error_invalid, "missing schedule", goto error)
731 isl_schedule *schedule; local
[all...] |
| /src/games/trek/ |
| schedule.c | 1 /* $NetBSD: schedule.c,v 1.12 2022/05/22 11:27:33 andvar Exp $ */
35 static char sccsid[] = "@(#)schedule.c 8.1 (Berkeley) 5/31/93";
37 __RCSID("$NetBSD: schedule.c,v 1.12 2022/05/22 11:27:33 andvar Exp $");
48 ** SCHEDULE AN EVENT
58 schedule(int type, double offset, int x, int y, int z) function
72 printf("schedule: type %d @ %.2f "
84 errx(1, "Cannot schedule event %d parm %d %d %d", type, x, y, z);
140 ** Abbreviated schedule routine
154 return (schedule(ev, when, x, y, z));
|
| /src/crypto/external/bsd/heimdal/dist/lib/krb5/ |
| salt-des.c | 85 DES_key_schedule schedule; local
104 DES_set_key_unchecked (&temp_key, &schedule);
105 DES_cbc_cksum ((void*)password, &ivec, passlen, &schedule, &ivec);
109 DES_set_key_unchecked (&temp_key, &schedule);
110 DES_cbc_cksum ((void*)password, key, passlen, &schedule, &ivec);
111 memset(&schedule, 0, sizeof(schedule));
142 DES_key_schedule schedule; local
164 DES_set_key_unchecked(key, &schedule);
165 DES_cbc_cksum((void*)data, key, length, &schedule, key)
[all...] |
| crypto.h | 42 krb5_data *schedule; member in struct:_krb5_key_data
88 void (*schedule)(krb5_context, struct _krb5_key_type *, struct _krb5_key_data *); member in struct:_krb5_key_type
|
| /src/crypto/external/bsd/heimdal/dist/lib/gssapi/krb5/ |
| get_mic.c | 54 DES_key_schedule schedule; local
96 DES_set_key_unchecked (&deskey, &schedule);
98 &schedule, &zero);
143 memset_s(&schedule, sizeof(schedule), 0, sizeof(schedule));
|
| verify_mic.c | 55 DES_key_schedule schedule; local
90 DES_set_key_unchecked (&deskey, &schedule);
92 &schedule, &zero);
95 memset_s(&schedule, sizeof(schedule), 0, sizeof(schedule));
125 memset_s(&schedule, sizeof(schedule), 0, sizeof(schedule));
|
| unwrap.c | 56 DES_key_schedule schedule; local
134 memset (&schedule, 0, sizeof(schedule));
157 DES_set_key_unchecked (&deskey, &schedule);
159 &schedule, &zero);
189 memset (&schedule, 0, sizeof(schedule));
|
| wrap.c | 216 DES_key_schedule schedule; local
284 DES_set_key_unchecked (&deskey, &schedule);
286 &schedule, &zero);
356 memset (&schedule, 0, sizeof(schedule));
|
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| DFAPacketizer.cpp | 12 // the target's Schedule.td file.
103 // This class extends ScheduleDAGInstrs and overrides the schedule method
116 void schedule() override;
142 void DefaultVLIWScheduler::schedule() { function in class:DefaultVLIWScheduler
191 VLIWScheduler->schedule();
|
| PostRASchedulerList.cpp | 10 // The basic approach uses a priority queue of available nodes to schedule.
12 // order), checked for legality to schedule, and emitted if legal.
14 // Nodes may not be legal to schedule either due to structural hazards (e.g.
65 // If DebugDiv > 0 then only schedule MBB with (ID % DebugDiv) == DebugMod
132 /// The schedule. Null SUnit*'s represent noop instructions.
170 /// Schedule - Schedule the instruction range using list scheduling.
172 void schedule() override;
242 /// Print the schedule before exiting the region.
245 dbgs() << "*** Final schedule ***\n"
389 void SchedulePostRATDList::schedule() { function in class:SchedulePostRATDList
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/ |
| GCNMinRegStrategy.cpp | 74 std::vector<const SUnit*> schedule(ArrayRef<const SUnit*> TopRoots,
225 GCNMinRegScheduler::schedule(ArrayRef<const SUnit*> TopRoots, function in class:GCNMinRegScheduler
228 std::vector<const SUnit*> Schedule;
229 Schedule.reserve(SUnits.size());
256 Schedule.push_back(SU);
264 assert(SUnits.size() == Schedule.size());
266 return Schedule;
274 return S.schedule(TopRoots, DAG);
|
| GCNILPSched.cpp | 50 std::vector<const SUnit*> schedule(ArrayRef<const SUnit*> TopRoots,
84 // Lower priority means schedule further down. For bottom-up scheduling, lower
97 // If SU does not have a register def, schedule it close to its uses
192 // Try schedule def + use closer when Sethi-Ullman numbers are the same.
201 // Then schedule t2 = op first.
290 GCNILPScheduler::schedule(ArrayRef<const SUnit*> BotRoots, function in class:GCNILPScheduler
312 std::vector<const SUnit*> Schedule;
313 Schedule.reserve(SUnits.size());
342 Schedule.push_back(SU);
345 assert(SUnits.size() == Schedule.size())
[all...] |
| GCNIterativeScheduler.cpp | 96 OS << "Region to schedule ";
185 void schedule() { function in class:GCNIterativeScheduler::OverrideLegacyStrategy
189 Sch.BaseClass::schedule();
201 // so just use SUnits as the restoring schedule
262 // returns max pressure for a tentative schedule
265 Range &&Schedule) const {
270 // schedule doesn't include it
277 for (auto I = Schedule.end(), B = Schedule.begin(); I != B;) {
296 void GCNIterativeScheduler::schedule() { // override function in class:GCNIterativeScheduler
[all...] |
| GCNSchedStrategy.cpp | 85 // by the same amount, the generic scheduler will prefer to schedule the
172 // Schedule as far as possible in the direction of no choice. This is most
311 void GCNScheduleDAGMILive::schedule() { function in class:GCNScheduleDAGMILive
341 ScheduleDAGMILive::schedule();
571 // to schedule low register pressure blocks.
634 schedule();
|
| SIMachineScheduler.cpp | 204 // Schedule low latency instructions as top as possible.
268 // Schedule something valid.
379 void SIScheduleBlock::schedule(MachineBasicBlock::iterator BeginBlock, function in class:SIScheduleBlock
388 // Schedule for real now.
1117 // thus putting exports at the end of the schedule, which
1312 // We do schedule a valid scheduling such that a Block corresponds
1359 // We do the final schedule for the instructions inside the block.
1365 Block->schedule((*SUs.begin())->getInstr(), (*SUs.rbegin())->getInstr());
1553 // Schedule high latencies early so you can hide them better.
1899 void SIScheduleDAGMI::schedule() function in class:SIScheduleDAGMI
[all...] |
| /src/external/mpl/dhcp/bind/dist/lib/isc/ |
| timer.c | 104 schedule(isc_timer_t *timer, isc_time_t *now, bool signal_ok) { function
144 * Schedule the timer.
170 XTRACETIMER("schedule", timer, due);
180 XTRACE("signal (schedule)");
338 result = schedule(timer, &now, true);
424 result = schedule(timer, &now, true);
601 result = schedule(timer, now, false);
605 "couldn't schedule "
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/ |
| HexagonMachineScheduler.cpp | 188 /// schedule - Called back from MachineScheduler::runOnMachineFunction
191 void VLIWMachineScheduler::schedule() { function in class:VLIWMachineScheduler
227 dbgs() << "** VLIWMachineScheduler::schedule picking next node\n");
246 dbgs() << "*** Final schedule for "
675 // want to schedule an instruction that causes a spill.
880 // Schedule as far as possible in the direction of no choice. This is most
899 // Excess pressure, we can immediately schedule from that Q.
903 // increase pressure for one of the excess PSets, then schedule in that
944 /// Pick the best node to balance the schedule. Implements MachineSchedStrategy.
|
| /src/lib/librumpuser/ |
| rumpfiber.c | 139 schedule(void) function
283 schedule();
292 /* Schedule will free the resources */
294 schedule();
295 printk("schedule() returned! Trying again\n");
314 schedule();
331 schedule();
340 schedule();
356 schedule();
606 schedule();
[all...] |
| /src/external/gpl3/gcc/dist/libgomp/ |
| env.c | 144 enum gomp_schedule_type *schedule = (enum gomp_schedule_type *) params[0]; local
177 *schedule = GFS_STATIC;
182 *schedule = GFS_DYNAMIC;
187 *schedule = GFS_GUIDED;
192 *schedule = GFS_AUTO;
199 || (monotonic == 0 && *schedule == GFS_STATIC))
200 *schedule |= GFS_MONOTONIC;
206 *chunk_size = (*schedule & ~GFS_MONOTONIC) != GFS_STATIC;
229 if (value == 0 && (*schedule & ~GFS_MONOTONIC) != GFS_STATIC)
1574 { ENTRY ("SCHEDULE"),
[all...] |
