HomeSort by relevance Sort by last modified time
    Searched refs:Cycle (Results 1 - 14 of 14) sorted by null

  /external/jmonkeyengine/engine/src/core/com/jme3/animation/
LoopMode.java 54 * The animation will cycle back and forth. When reaching the end, the
58 Cycle,
AnimChannel.java 79 case Cycle:
88 case Cycle:
  /external/jmonkeyengine/engine/src/test/jme3test/model/anim/
TestOgreComplexAnim.java 85 feet.setLoopMode(LoopMode.Cycle);
90 feet.setLoopMode(LoopMode.Cycle);
TestOgreAnim.java 113 channel.setLoopMode(LoopMode.Cycle);
  /build/core/
node_fns.mk 170 $(eval ### "If we just inherited ourselves, it's a cycle.") \
172 $(warning Cycle detected between "$(2)" and "$(i)" for context "$(1)") \
  /external/jmonkeyengine/engine/src/core/com/jme3/cinematic/events/
AnimationTrack.java 115 if(loopMode == loopMode.Cycle){
  /external/llvm/include/llvm/CodeGen/
ScheduleDAG.h 485 void setCurCycle(unsigned Cycle) {
486 CurCycle = Cycle;
683 /// will create a cycle.
  /external/chromium/base/
file_descriptor_shuffle_unittest.cc 143 TEST(FileDescriptorShuffleTest, Cycle) {
  /external/llvm/lib/CodeGen/
IfConversion.cpp 97 /// ExtraCost - Extra cost for multi-cycle instructions.
207 unsigned Cycle, unsigned Extra,
209 return Cycle > 0 && TII->isProfitableToIfCvt(BB, Cycle, Extra,
    [all...]
  /external/oprofile/events/i386/nehalem/
events 34 event:0x17 counters:0,1,2,3 um:one minimum:6000 name:INST_QUEUE_WRITES : Counts the number of instructions written into the instruction queue every cycle.
38 event:0x1E counters:0,1,2,3 um:one minimum:6000 name:INST_QUEUE_WRITE_CYCLES : This event counts the number of cycles during which instructions are written to the instruction queue. Dividing this counter by the number of instructions written to the instruction queue (INST_QUEUE_WRITES) yields the average number of instructions decoded each cycle. If this number is less than four and the pipe stalls, this indicates that the decoder is failing to decode enough instructions per cycle to sustain the 4-wide pipeline.
60 event:0x63 counters:0,1 um:cache_lock_cycles minimum:6000 name:CACHE_LOCK_CYCLES : Cycle count during which the L1/L2 caches are locked. A lock is asserted when there is a locked memory access, due to uncacheable memory, a locked operation that spans two cache lines, or a page walk from an uncacheable page table.
72 event:0xA7 counters:0,1,2,3 um:one minimum:6000 name:BACLEAR_FORCE_IQ : Counts number of times a BACLEAR was forced by the Instruction Queue. The IQ is also responsible for providing conditional branch prediciton direction based on a static scheme and dynamic data provided by the L2 Branch Prediction Unit. If the conditional branch target is not found in the Target Array and the IQ predicts that the branch is taken, then the IQ will force the Branch Address Calculator to issue a BACLEAR. Each BACLEAR asserted by the BAC generates approximately an 8 cycle bubble in the instruction fetch pipeline.
82 event:0xC2 counters:0,1,2,3 um:uops_retired minimum:6000 name:UOPS_RETIRED : Counts the number of micro-ops retired, (macro-fused=1, micro-fused=2, others=1; maximum count of 8 per cycle). Most instructions are composed of one or two microops. Some instructions are decoded into longer sequences such as repeat instructions, floating point transcendental instructions, and assists
  /external/v8/benchmarks/
deltablue.js 185 alert("Cycle encountered");
586 * constraint graph has an inadvertent cycle.
681 * values of all variables whose stay flag is true. If a cycle is
  /external/webkit/PerformanceTests/SunSpider/tests/v8-v4/
v8-deltablue.js 179 alert("Cycle encountered");
580 * constraint graph has an inadvertent cycle.
675 * values of all variables whose stay flag is true. If a cycle is
  /external/webkit/PerformanceTests/SunSpider/tests/v8-v5/
v8-deltablue.js 179 alert("Cycle encountered");
580 * constraint graph has an inadvertent cycle.
675 * values of all variables whose stay flag is true. If a cycle is
  /external/webkit/PerformanceTests/SunSpider/tests/v8-v6/
v8-deltablue.js 179 alert("Cycle encountered");
580 * constraint graph has an inadvertent cycle.
675 * values of all variables whose stay flag is true. If a cycle is

Completed in 639 milliseconds