| /external/llvm/lib/Target/X86/ |
| X86PadShortFunction.cpp | 42 // Cycles - Number of cycles until return if HasReturn is true, otherwise
43 // number of cycles until end of the BB
44 unsigned int Cycles;
46 VisitedBBInfo() : HasReturn(false), Cycles(0) {}
47 VisitedBBInfo(bool HasReturn, unsigned int Cycles)
48 : HasReturn(HasReturn), Cycles(Cycles) {}
64 unsigned int Cycles = 0);
67 unsigned int &Cycles);
[all...] |
| /external/llvm/include/llvm/MC/ |
| MCSchedule.h | 41 // fixed number of cycles after dispatch. If a resource is unbuffered, then
54 /// scheduling class for the specified number of cycles.
57 unsigned Cycles;
60 return ProcResourceIdx == Other.ProcResourceIdx && Cycles == Other.Cycles;
64 /// Specify the latency in cpu cycles for a particular scheduling class and def
70 int Cycles;
74 return Cycles == Other.Cycles && WriteResourceID == Other.WriteResourceID;
78 /// Specify the number of cycles allowed after instruction issue before
[all...] |
| MCSubtargetInfo.h | 43 const unsigned *OperandCycles; // Itinerary operand cycles
148 return I->Cycles;
|
| /external/dagger2/compiler/src/it/functional-tests/src/test/java/test/cycle/ |
| CycleTest.java | 21 import test.cycle.Cycles.A;
22 import test.cycle.Cycles.C;
23 import test.cycle.Cycles.ChildCycleComponent;
24 import test.cycle.Cycles.CycleComponent;
25 import test.cycle.Cycles.CycleMapComponent;
26 import test.cycle.Cycles.S;
27 import test.cycle.Cycles.SelfCycleComponent;
|
| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/bfin/ |
| stack.s | 8 [--sP] = Cycles;
|
| move.s | 23 R2 = Cycles;
|
| /external/llvm/lib/CodeGen/ |
| TargetSchedule.cpp | 95 static unsigned capLatency(int Cycles) {
96 return Cycles >= 0 ? Cycles : 1000;
194 unsigned Latency = capLatency(WLEntry->Cycles);
233 Latency = std::max(Latency, capLatency(WLEntry->Cycles));
|
| MachineTraceMetrics.cpp | 95 // Add up per-processor resource cycles as well.
117 PRCycles[PI->ProcResourceIdx] += PI->Cycles;
122 // Scale the resource cycles so they are comparable.
326 // Ignore cycles that aren't natural loops.
354 // Ignore cycles that aren't natural loops.
445 // To is a new block. Mark the block as visited in case the CFG has cycles
558 Cycles.erase(&I);
766 unsigned Len = LIR.Height + Cycles[DefMI].Depth;
839 unsigned DepCycle = Cycles.lookup(Dep.DefMI).Depth;
847 InstrCycles &MICycles = Cycles[&UseMI]
[all...] |
| MachineScheduler.cpp | [all...] |
| /external/dagger2/compiler/src/it/functional-tests/src/main/java/test/cycle/ |
| Cycles.java | 39 final class Cycles {
40 private Cycles() {}
|
| /external/llvm/include/llvm/CodeGen/ |
| MachineTraceMetrics.h | 36 // cycles required to execute the trace when execution is limited by data
38 // of cycles required to execute all instructions in the trace when ignoring
41 // Every instruction in the current block has a slack - the number of cycles
110 /// Get the scaled number of cycles used per processor resource in MBB.
206 /// Critical path length. This is the number of cycles in the longest data
228 /// Minimum number of cycles from this instruction is issued to the of the
252 /// This is the number of cycles required to execute all instructions from
258 /// Return the resource length of the trace. This is the number of cycles
279 return TE.Cycles.lookup(MI);
282 /// Return the slack of MI. This is the number of cycles MI can be delaye
[all...] |
| MachineScheduler.h | 590 /// Number of cycles it takes to issue the instructions scheduled in this
660 /// Number of cycles to issue the instructions scheduled in this zone.
673 /// Get the number of latency cycles "covered" by the scheduled
675 /// and the number of cycles required to issue the instructions.
713 unsigned getNextResourceCycle(unsigned PIdx, unsigned Cycles);
731 unsigned countResource(unsigned PIdx, unsigned Cycles, unsigned ReadyCycle);
|
| /external/llvm/utils/TableGen/ |
| SubtargetEmitter.cpp | 92 void ExpandProcResources(RecVec &PRVec, std::vector<int64_t> &Cycles,
288 // Form string as ,{ cycles, u1 | u2 | ... | un, timeinc, kind }
289 int Cycles = Stage->getValueAsInt("Cycles");
290 ItinString += " { " + itostr(Cycles) + ", ";
317 // number of operands that has cycles specified.
418 // operand cycles, and pipepine bypess tables. Then add the new Itinerary
469 // Emit as { cycles, u1 | u2 | ... | un, timeinc }, // indices
517 // Closing operand cycles
518 OperandCycleTable += " 0 // End operand cycles\n"
[all...] |
| /external/llvm/lib/Target/AMDGPU/ |
| R600InstrInfo.cpp | 418 unsigned Cycles[3] = { 2, 1, 0};
419 return Cycles[Op];
422 unsigned Cycles[3] = { 1, 2, 2};
423 return Cycles[Op];
426 unsigned Cycles[3] = { 2, 1, 2};
427 return Cycles[Op];
430 unsigned Cycles[3] = { 2, 2, 1};
431 return Cycles[Op];
[all...] |
| /external/libavc/common/arm/ |
| ih264_resi_trans_quant_a9.s | 67 @ Cycles : Around
265 @ Cycles : Around
454 @ Cycles : Around
602 @ Cycles : Around
|
| /external/llvm/lib/MC/MCDisassembler/ |
| Disassembler.cpp | 208 Latency = std::max(Latency, WLEntry->Cycles);
|
| /prebuilts/go/darwin-x86/src/runtime/pprof/ |
| pprof.go | 627 func (x byCycles) Less(i, j int) bool { return x[i].Cycles > x[j].Cycles }
659 fmt.Fprintf(w, "cycles/second=%v\n", runtime_cyclesPerSecond())
662 fmt.Fprintf(w, "%v %v @", r.Cycles, r.Count)
|
| /prebuilts/go/linux-x86/src/runtime/pprof/ |
| pprof.go | 627 func (x byCycles) Less(i, j int) bool { return x[i].Cycles > x[j].Cycles }
659 fmt.Fprintf(w, "cycles/second=%v\n", runtime_cyclesPerSecond())
662 fmt.Fprintf(w, "%v %v @", r.Cycles, r.Count)
|
| /prebuilts/go/darwin-x86/src/runtime/ |
| mprof.go | 88 cycles int64
281 // convert ns to cycles, use float64 to prevent overflow during multiplication
291 func blockevent(cycles int64, skip int) {
292 if cycles <= 0 {
293 cycles = 1
296 if rate <= 0 || (rate > cycles && int64(fastrand1())%rate > cycles) {
310 b.bp().cycles += cycles
455 Cycles int6
[all...] |
| /prebuilts/go/linux-x86/src/runtime/ |
| mprof.go | 88 cycles int64
281 // convert ns to cycles, use float64 to prevent overflow during multiplication
291 func blockevent(cycles int64, skip int) {
292 if cycles <= 0 {
293 cycles = 1
296 if rate <= 0 || (rate > cycles && int64(fastrand1())%rate > cycles) {
310 b.bp().cycles += cycles
455 Cycles int6
[all...] |
| /external/v8/benchmarks/ |
| deltablue.js | 684 * Details: Cycles are detected when a marked variable is
|
| /external/libavc/encoder/arm/ |
| ime_distortion_metrics_a9q.s | 964 @* Cycles : Around
[all...] |
| /external/v8/test/mjsunit/ |
| unicode-test.js | 357 " 6. Korotayev A., Malkov A., Khaltourina D. Introduction to Social Macrodynamics: Secular Cycles and Millennial Trends. Moscow: URSS, 2006. ISBN 5-484-00559-0 [1] (Chapter 2: Historical Population Dynamics in China).\n" +
[all...] |
