| /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/ |
| GCNIterativeScheduler.h | 11 /// approach to find a best schedule for GCN architecture. It basically makes
43 void schedule() override;
56 std::vector<MachineInstr *> Schedule;
62 // `const` fields are to emphasize they shouldn't change for any schedule.
69 // best schedule for the region so far (not scheduled yet)
85 Range &&Schedule) const;
95 ScheduleRef Schedule,
100 std::vector<MachineInstr*> detachSchedule(ScheduleRef Schedule) const;
105 void scheduleRegion(Region &R, Range &&Schedule,
|
| 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...] |
| 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...] |
| 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);
|
| /src/lib/libtelnet/ |
| encrypt.h | 65 #define Schedule des_key_schedule
|
| enc_des.c | 67 Schedule krbdes_sched;
79 Schedule str_sched;
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/ |
| ModuloSchedule.h | 1 //===- ModuloSchedule.h - Software pipeline schedule expansion ------------===//
12 // There are multiple methods for analyzing a loop and creating a schedule.
14 // MachinePipeliner). The details of how a schedule is arrived at are irrelevant
15 // for the task of actually rewriting a loop to adhere to the schedule, which
18 // A schedule is, for every instruction in a block, a Cycle and a Stage. Note
37 // In the schedule for this unrolled sequence we would say that I0 was scheduled
52 // an arbitrary schedule containing loop-carried values are complex.
76 /// Represents a schedule for a single-block loop. For every instruction we
84 /// order; the total order within cycles has been decided by the schedule
94 /// The number of stages in this schedule (Max(Stage) + 1)
[all...] |
| MachinePipeliner.h | 37 // 3) Attempt to schedule the nodes in the specified order using the MII.
105 /// and attempts to schedule the instructions using the SMS algorithm.
108 /// The minimum initiation interval between iterations for this schedule.
110 /// The maximum initiation interval between iterations for this schedule.
112 /// Set to true if a valid pipelined schedule is found for the loop.
143 /// Instructions to change when emitting the final schedule.
203 void schedule() override;
258 void applyInstrChange(MachineInstr *MI, SMSchedule &Schedule);
296 bool schedulePipeline(SMSchedule &Schedule);
303 /// Set the Minimum Initiation Interval for this schedule attempt
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| ModuloSchedule.cpp | 1 //===- ModuloSchedule.cpp - Software pipeline schedule expansion ----------===//
67 BB = Schedule.getLoop()->getTopBlock();
74 for (MachineInstr *MI : Schedule.getInstructions()) {
75 int DefStage = Schedule.getStage(MI);
89 int UseStage = Schedule.getStage(UseMI);
115 unsigned MaxStageCount = Schedule.getNumStages() - 1;
132 for (MachineInstr *CI : Schedule.getInstructions()) {
135 unsigned StageNum = Schedule.getStage(CI);
216 if (Schedule.getStage(&*BBI) == StageNum) {
294 if ((unsigned)Schedule.getStage(In) == StageNum)
[all...] |
| MachinePipeliner.cpp | 24 // where an instruction may be inserted in the pipelined schedule.
106 STATISTIC(NumFailNoSchedule, "Pipeliner abort due to no schedule found");
161 "with the generated schedule for feeding into the "
162 "-modulo-schedule-test pass"));
233 /// loops, calculates the minimum initiation interval, and attempts to schedule
418 /// 3. Attempt to Schedule the loop.
439 SMS.schedule();
470 /// We override the schedule function in ScheduleDAGInstrs to implement the
472 void SwingSchedulerDAG::schedule() { function in class:SwingSchedulerDAG
502 // Can't schedule a loop without a valid MII
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/ |
| ScheduleDAGVLIW.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.
82 void Schedule() override;
92 /// Schedule - Schedule the DAG using list scheduling.
93 void ScheduleDAGVLIW::Schedule() {
147 /// scheduleNodeTopDown - Add the node to the schedule. Decrement the pending
181 // priority. If it is not ready put it back. Schedule the node.
234 // If we found a node to schedule, do it now
[all...] |
| ScheduleDAGSDNodes.h | 52 /// The schedule. Null SUnit*'s represent noop instructions.
110 /// Schedule - Order nodes according to selected style, filling
113 virtual void Schedule() = 0;
|
| ScheduleDAGFast.cpp | 84 void Schedule() override;
116 /// Schedule - Schedule the DAG using list scheduling.
117 void ScheduleDAGFast::Schedule() {
178 /// ScheduleNodeBottomUp - Add the node to the schedule. Decrement the pending
465 /// If the specific node is the last one that's available to schedule, do
539 // priority. If it is not ready put it back. Schedule the node.
647 void Schedule() override;
681 // Schedule glue operand right above N.
715 void ScheduleDAGLinearize::Schedule() {
[all...] |
| /src/external/apache2/llvm/dist/clang/include/clang/Basic/ |
| OpenMPKinds.h | 28 /// OpenMP attributes for 'schedule' clause.
36 /// OpenMP modifiers for 'schedule' clause.
157 OpenMPScheduleClauseKind Schedule = OMPC_SCHEDULE_unknown;
|
| /src/external/apache2/llvm/dist/clang/lib/CodeGen/ |
| CGOpenMPRuntime.cpp | 546 /// Schedule types for 'omp for' loops (these enumerators are taken from
571 /// Support for OpenMP 4.5 monotonic and nonmonotonic schedule modifiers.
572 /// Set if the monotonic schedule modifier was present.
574 /// Set if the nonmonotonic schedule modifier was present.
2550 // case choose static, 1 schedule.
2614 /// Map the OpenMP loop schedule to the runtime enumeration.
2630 assert(!Chunked && "chunk was specified but schedule kind not known");
2633 llvm_unreachable("Unexpected runtime schedule");
2636 /// Map the OpenMP distribute schedule to the runtime enumeration.
2645 OpenMPSchedType Schedule
[all...] |
| CGStmtOpenMP.cpp | 2636 // Emit "IV = LB" (in case of static schedule, we have already calculated new
2709 Ordered || RT.isDynamic(ScheduleKind.Schedule);
2712 !RT.isStaticNonchunked(ScheduleKind.Schedule,
2714 "static non-chunked schedule does not need outer loop");
2719 // When schedule(dynamic,chunk_size) is specified, the iterations are
2726 // When schedule(guided,chunk_size) is specified, the iterations are assigned
2737 // When schedule(auto) is specified, the decision regarding scheduling is
2742 // When schedule(runtime) is specified, the decision regarding scheduling is
2743 // deferred until run time, and the schedule and chunk size are taken from the
2744 // run-sched-var ICV. If the ICV is set to auto, the schedule i
[all...] |
| /src/external/lgpl3/gmp/dist/mpn/powerpc64/mode64/p9/ |
| addmul_1.asm | 43 C * Schedule for Power9 pipeline.
|
| mul_1.asm | 43 C * Schedule for Power9 pipeline.
|
| /src/external/gpl3/gcc/dist/contrib/ |
| dg-extract-results.sh | 238 /^Schedule of variations:/ { in_vars=1; next }
281 echo "Schedule of variations:"
|
| /src/external/gpl3/gcc.old/dist/contrib/ |
| dg-extract-results.sh | 235 /^Schedule of variations:/ { in_vars=1; next }
278 echo "Schedule of variations:"
|
| /src/external/gpl3/gdb.old/dist/contrib/ |
| dg-extract-results.sh | 238 /^Schedule of variations:/ { in_vars=1; next }
281 echo "Schedule of variations:"
|
| /src/external/lgpl3/gmp/dist/mpn/m88k/ |
| mul_1.s | 49 ; 2. Schedule code to avoid WB contention. It might be tempting to move the
|
| /src/external/gpl3/gdb/dist/contrib/ |
| dg-extract-results.sh | 238 /^Schedule of variations:/ { in_vars=1; next }
281 echo "Schedule of variations:"
|
| /src/external/lgpl3/gmp/dist/mpn/powerpc64/mode64/p6/ |
| aorsmul_1.asm | 44 C * Schedule function entry code.
|
| /src/external/lgpl3/gmp/dist/mpn/x86_64/atom/ |
| rsh1aors_n.asm | 36 C * Schedule loop less. It is now almost surely overscheduled, resulting in
|
