Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched full:cycle (Results 201 - 225 of 1742) sorted by null

1 2 3 4 5 6 7 891011>>

/external/fio/lib/
lfsr.c	119 * i. Decrement the calculated cycle. 181 * sub-sequence (cycle) and its length. However, calculating (2^n - 1) * i may 187 * Also, the cycle's length will be (x * i) + (y * i) / (spin + 1) 200 fl->cycle_length = 0; /* No cycle occurs, other than the expected */ 212 * Increment cycle length for the first time only since the stored value
/external/icu/icu4c/source/i18n/
gregoimp.cpp	104 // For example, the 4-year cycle has 4 years + 1 leap day; giving 106 int32_t n400 = ClockMath::floorDivide(day, 146097, doy); // 400-year cycle length 107 int32_t n100 = ClockMath::floorDivide(doy, 36524, doy); // 100-year cycle length 108 int32_t n4 = ClockMath::floorDivide(doy, 1461, doy); // 4-year cycle length 112 doy = 365; // Dec 31 at end of 4- or 400-year cycle
/external/llvm/include/llvm/Target/
TargetItinerary.td	91 // that can issue per cycle. 93 // OperandCycles are optional "cycle counts". They specify the cycle after 105 // In this example, the instruction of IIC_iLoadi reads its input on cycle 1 106 // (after issue) and the result of the load is available on cycle 3. The result
/frameworks/av/media/libstagefright/codecs/amrnb/enc/src/
sid_sync.cpp	153 CLOCK CYCLES: (cycle count equation for this function) + (variable 154 used to represent cycle count for each subroutine 156 where: (cycle count variable) = cycle count for [subroutine 246 CLOCK CYCLES: (cycle count equation for this function) + (variable 247 used to represent cycle count for each subroutine 249 where: (cycle count variable) = cycle count for [subroutine 323 CLOCK CYCLES: (cycle count equation for this function) + (variable 324 used to represent cycle count for each subroutin     [all...]
sp_enc.cpp	202 CLOCK CYCLES: (cycle count equation for this function) + (variable 203 used to represent cycle count for each subroutine 205 where: (cycle count variable) = cycle count for [subroutine 328 CLOCK CYCLES: (cycle count equation for this function) + (variable 329 used to represent cycle count for each subroutine 331 where: (cycle count variable) = cycle count for [subroutine 437 CLOCK CYCLES: (cycle count equation for this function) + (variable 438 used to represent cycle count for each subroutin     [all...]
c8_31pf.cpp	45 Description: Optimized file to reduce clock cycle usage. Updated copyright 165 CLOCK CYCLES: (cycle count equation for this function) + (variable 166 used to represent cycle count for each subroutine 168 where: (cycle count variable) = cycle count for [subroutine 423 CLOCK CYCLES: (cycle count equation for this function) + (variable 424 used to represent cycle count for each subroutine 426 where: (cycle count variable) = cycle count for [subroutine 552 CLOCK CYCLES: (cycle count equation for this function) + (variabl     [all...]
dtx_enc.cpp	226 CLOCK CYCLES: (cycle count equation for this function) + (variable 227 used to represent cycle count for each subroutine 229 where: (cycle count variable) = cycle count for [subroutine 347 CLOCK CYCLES: (cycle count equation for this function) + (variable 348 used to represent cycle count for each subroutine 350 where: (cycle count variable) = cycle count for [subroutine 454 CLOCK CYCLES: (cycle count equation for this function) + (variable 455 used to represent cycle count for each subroutin     [all...]
ton_stab.cpp	171 CLOCK CYCLES: (cycle count equation for this function) + (variable 172 used to represent cycle count for each subroutine 174 where: (cycle count variable) = cycle count for [subroutine 276 CLOCK CYCLES: (cycle count equation for this function) + (variable 277 used to represent cycle count for each subroutine 279 where: (cycle count variable) = cycle count for [subroutine 368 CLOCK CYCLES: (cycle count equation for this function) + (variable 369 used to represent cycle count for each subroutin     [all...]
/frameworks/support/v4/java/android/support/v4/widget/
SwipeProgressBar.java	30 * Custom progress bar that shows a cycle of colors as widening circles that 32 * the main cycle continues. Before running, this can also indicate how close 44 // The duration of the animation cycle. 195 // along we are in the cycle. 230 // Keep running until we finish out the last cycle.
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/sysroot/usr/include/linux/
firewire-cdev.h	134 * @cycle: Cycle counter of the interrupt packet 163 __u32 cycle; member in struct:fw_cdev_event_iso_interrupt 515 * @cycle: Cycle in which to start I/O. If @cycle is greater than or 516 * equal to 0, the I/O will start on that cycle. 525 __s32 cycle; member in struct:fw_cdev_start_iso 540 * struct fw_cdev_get_cycle_timer - read cycle timer register 542 * @cycle_timer: isochronous cycle timer, as per OHCI 1.1 clause 5.1     [all...]
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/sysroot/usr/include/linux/
firewire-cdev.h	134 * @cycle: Cycle counter of the interrupt packet 163 __u32 cycle; member in struct:fw_cdev_event_iso_interrupt 515 * @cycle: Cycle in which to start I/O. If @cycle is greater than or 516 * equal to 0, the I/O will start on that cycle. 525 __s32 cycle; member in struct:fw_cdev_start_iso 540 * struct fw_cdev_get_cycle_timer - read cycle timer register 542 * @cycle_timer: isochronous cycle timer, as per OHCI 1.1 clause 5.1     [all...]
/frameworks/av/media/libstagefright/codecs/amrnb/dec/src/
agc.cpp	155 CLOCK CYCLES: (cycle count equation for this function) + (variable 156 used to represent cycle count for each subroutine 158 where: (cycle count variable) = cycle count for [subroutine 245 CLOCK CYCLES: (cycle count equation for this function) + (variable 246 used to represent cycle count for each subroutine 248 where: (cycle count variable) = cycle count for [subroutine 357 CLOCK CYCLES: (cycle count equation for this function) + (variable 358 used to represent cycle count for each subroutin     [all...]
ph_disp.cpp	71 Description: Optimized ph_disp() to reduce clock cycle usage. Updated 195 CLOCK CYCLES: (cycle count equation for this function) + (variable 196 used to represent cycle count for each subroutine 198 where: (cycle count variable) = cycle count for [subroutine 286 CLOCK CYCLES: (cycle count equation for this function) + (variable 287 used to represent cycle count for each subroutine 289 where: (cycle count variable) = cycle count for [subroutine 363 CLOCK CYCLES: (cycle count equation for this function) + (variabl     [all...]
ec_gains.cpp	186 CLOCK CYCLES: (cycle count equation for this function) + (variable 187 used to represent cycle count for each subroutine 189 where: (cycle count variable) = cycle count for [subroutine 303 CLOCK CYCLES: (cycle count equation for this function) + (variable 304 used to represent cycle count for each subroutine 306 where: (cycle count variable) = cycle count for [subroutine 440 CLOCK CYCLES: (cycle count equation for this function) + (variable 441 used to represent cycle count for each subroutin     [all...]
/frameworks/av/media/libstagefright/codecs/amrnb/common/src/
vad1.cpp	153 CLOCK CYCLES: (cycle count equation for this function) + (variable 154 used to represent cycle count for each subroutine 156 where: (cycle count variable) = cycle count for [subroutine 284 CLOCK CYCLES: (cycle count equation for this function) + (variable 285 used to represent cycle count for each subroutine 287 where: (cycle count variable) = cycle count for [subroutine 388 CLOCK CYCLES: (cycle count equation for this function) + (variable 389 used to represent cycle count for each subroutin     [all...]
/external/antlr/antlr-3.4/runtime/C/include/
antlr3collections.h	427 * visited in the stack, then it means there wasa cycle such as 9->8->1->9 432 pANTLR3_UINT32 cycle; member in struct:ANTLR3_TOPO_struct 435 * A flag that indicates the algorithm found a cycle in the edges 438 * then the detected cycle will be contained in the cycle array and 439 * cycleLimit will point to the one after the last entry in the cycle. 444 * A watermark used to accumulate potential cycles in the cycle array. 446 * of the sort methods and if it is ANTLR3_TRUE then you can find the cycle 447 * in cycle[0]...cycle[cycleMark-1     [all...]
/external/llvm/lib/Target/Hexagon/
HexagonMachineScheduler.cpp	48 // in the current cycle. 128 // If packet is now full, reset the state so in the next cycle 269 /// can dispatch per cycle. 297 /// Move the boundary of scheduled code by one cycle. 319 DEBUG(dbgs() << "*** " << Available.getName() << " cycle " 344 DEBUG(dbgs() << "*** Max instrs at cycle " << CurrCycle << '\n'); 349 << " at cycle " << CurrCycle << '\n'); 392 /// advance the cycle until at least one node is ready. If multiple instructions 676 << " Scheduling Instruction in cycle " 684 /// to update it's state based on the current cycle before MachineSchedStrateg     [all...]
HexagonMachineScheduler.h	131 /// current cycle in whichever direction at has moved, and maintains the state 132 /// of "hazards" and other interlocks at the current cycle. 147 /// MinReadyCycle - Cycle of the soonest available instruction.
/external/chromium_org/chrome/common/extensions/docs/templates/intros/
webRequest.html	21 <h2 id="life_cycle">Life cycle of requests</h2> 24 The web request API defines a set of events that follow the life cycle of a web 30 The event life cycle for successful requests is illustrated here, followed by 34 alt="Life cycle of a web request from the perspective of the webrequest API" 153 the life cycle of a request and can be used to match events for the same 191 life cycle of the request. Depending on the context, this response allows
/packages/apps/Settings/src/com/android/settings/
DataUsageSummary.java	151 * to inspect based on usage cycle and control through {@link NetworkPolicy}.     [all...]
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib-dynload/
itertools.so
/external/chromium_org/third_party/tcmalloc/chromium/src/base/
cycleclock.h	79 // https://setisvn.ssl.berkeley.edu/svn/lib/fftw-3.0.1/kernel/cycle.h 103 // This returns a time-base, which is not always precisely a cycle-count. 139 // The counter is set up to count every 64th cycle
/external/chromium_org/third_party/tcmalloc/vendor/src/base/
cycleclock.h	77 // https://setisvn.ssl.berkeley.edu/svn/lib/fftw-3.0.1/kernel/cycle.h 101 // This returns a time-base, which is not always precisely a cycle-count. 137 // The counter is set up to count every 64th cycle
/external/llvm/test/Transforms/BBVectorize/
cycle.ll	4 ; This test checks the non-trivial pairing-induced cycle avoidance. Without this cycle avoidance, the algorithm would otherwise 10 ; and so a dependency cycle would be created.
/external/oprofile/events/arm/armv7/
events.h	42 "Any write buffer full cycle"}, 84 "Number of operations executed (in instruction or mutli-cycle instruction)"}, 88 "Number of instructions issued in a cycle"},

Completed in 2899 milliseconds

1 2 3 4 5 6 7 891011>>